Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme16 Structured version   Visualization version   GIF version

Theorem cdleme16 36067
Description: Part of proof of Lemma E in [Crawley] p. 113, conclusion of 3rd paragraph on p. 114. 𝐹 and 𝐺 represent f(s) and f(t) respectively. We show, in their notation, (s t) w=(f(s) f(t)) w, whether or not u s t. (Contributed by NM, 11-Oct-2012.)
Hypotheses
Ref Expression
cdleme12.l = (le‘𝐾)
cdleme12.j = (join‘𝐾)
cdleme12.m = (meet‘𝐾)
cdleme12.a 𝐴 = (Atoms‘𝐾)
cdleme12.h 𝐻 = (LHyp‘𝐾)
cdleme12.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme12.f 𝐹 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
cdleme12.g 𝐺 = ((𝑇 𝑈) (𝑄 ((𝑃 𝑇) 𝑊)))
Assertion
Ref Expression
cdleme16 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))

Proof of Theorem cdleme16
StepHypRef Expression
1 simpl11 1312 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simpl12 1314 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
3 simpl13 1316 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
4 simpl21 1318 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
5 simpl22 1320 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑇𝐴 ∧ ¬ 𝑇 𝑊))
6 simpl23 1322 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑃𝑄𝑆𝑇))
7 simpl3l 1284 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ¬ 𝑆 (𝑃 𝑄))
8 simpl3r 1286 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ¬ 𝑇 (𝑃 𝑄))
9 simpr 479 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → 𝑈 (𝑆 𝑇))
10 cdleme12.l . . . . . 6 = (le‘𝐾)
11 cdleme12.j . . . . . 6 = (join‘𝐾)
12 cdleme12.m . . . . . 6 = (meet‘𝐾)
13 cdleme12.a . . . . . 6 𝐴 = (Atoms‘𝐾)
14 cdleme12.h . . . . . 6 𝐻 = (LHyp‘𝐾)
15 cdleme12.u . . . . . 6 𝑈 = ((𝑃 𝑄) 𝑊)
16 cdleme12.f . . . . . 6 𝐹 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
17 cdleme12.g . . . . . 6 𝐺 = ((𝑇 𝑈) (𝑄 ((𝑃 𝑇) 𝑊)))
1810, 11, 12, 13, 14, 15, 16, 17cdleme11 36052 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄) ∧ 𝑈 (𝑆 𝑇))) → (𝐹 𝐺) = (𝑆 𝑇))
191, 2, 3, 4, 5, 6, 7, 8, 9, 18syl333anc 1505 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝐹 𝐺) = (𝑆 𝑇))
2019eqcomd 2758 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑆 𝑇) = (𝐹 𝐺))
2120oveq1d 6820 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
22 simpl11 1312 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
23 simpl12 1314 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simpl13 1316 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
25 simpl21 1318 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
26 simpl22 1320 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑇𝐴 ∧ ¬ 𝑇 𝑊))
27 simpl23 1322 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑃𝑄𝑆𝑇))
28 simpl3l 1284 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑆 (𝑃 𝑄))
29 simpl3r 1286 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑇 (𝑃 𝑄))
30 simpr 479 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑈 (𝑆 𝑇))
3110, 11, 12, 13, 14, 15, 16, 17cdleme16g 36066 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄) ∧ ¬ 𝑈 (𝑆 𝑇))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
3222, 23, 24, 25, 26, 27, 28, 29, 30, 31syl333anc 1505 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
3321, 32pm2.61dan 867 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1072   = wceq 1624  wcel 2131  wne 2924   class class class wbr 4796  cfv 6041  (class class class)co 6805  lecple 16142  joincjn 17137  meetcmee 17138  Atomscatm 35045  HLchlt 35132  LHypclh 35765
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1863  ax-4 1878  ax-5 1980  ax-6 2046  ax-7 2082  ax-8 2133  ax-9 2140  ax-10 2160  ax-11 2175  ax-12 2188  ax-13 2383  ax-ext 2732  ax-rep 4915  ax-sep 4925  ax-nul 4933  ax-pow 4984  ax-pr 5047  ax-un 7106
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1627  df-ex 1846  df-nf 1851  df-sb 2039  df-eu 2603  df-mo 2604  df-clab 2739  df-cleq 2745  df-clel 2748  df-nfc 2883  df-ne 2925  df-ral 3047  df-rex 3048  df-reu 3049  df-rab 3051  df-v 3334  df-sbc 3569  df-csb 3667  df-dif 3710  df-un 3712  df-in 3714  df-ss 3721  df-nul 4051  df-if 4223  df-pw 4296  df-sn 4314  df-pr 4316  df-op 4320  df-uni 4581  df-iun 4666  df-iin 4667  df-br 4797  df-opab 4857  df-mpt 4874  df-id 5166  df-xp 5264  df-rel 5265  df-cnv 5266  df-co 5267  df-dm 5268  df-rn 5269  df-res 5270  df-ima 5271  df-iota 6004  df-fun 6043  df-fn 6044  df-f 6045  df-f1 6046  df-fo 6047  df-f1o 6048  df-fv 6049  df-riota 6766  df-ov 6808  df-oprab 6809  df-mpt2 6810  df-1st 7325  df-2nd 7326  df-preset 17121  df-poset 17139  df-plt 17151  df-lub 17167  df-glb 17168  df-join 17169  df-meet 17170  df-p0 17232  df-p1 17233  df-lat 17239  df-clat 17301  df-oposet 34958  df-ol 34960  df-oml 34961  df-covers 35048  df-ats 35049  df-atl 35080  df-cvlat 35104  df-hlat 35133  df-llines 35279  df-lplanes 35280  df-lvols 35281  df-lines 35282  df-psubsp 35284  df-pmap 35285  df-padd 35577  df-lhyp 35769
This theorem is referenced by:  cdleme19b  36086  cdleme20d  36094  cdleme22g  36130
  Copyright terms: Public domain W3C validator