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 35049
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 1134 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simpl12 1135 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
3 simpl13 1136 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
4 simpl21 1137 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
5 simpl22 1138 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑇𝐴 ∧ ¬ 𝑇 𝑊))
6 simpl23 1139 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑃𝑄𝑆𝑇))
7 simpl3l 1114 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ¬ 𝑆 (𝑃 𝑄))
8 simpl3r 1115 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ¬ 𝑇 (𝑃 𝑄))
9 simpr 477 . . . . 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 35034 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄) ∧ 𝑈 (𝑆 𝑇))) → (𝐹 𝐺) = (𝑆 𝑇))
191, 2, 3, 4, 5, 6, 7, 8, 9, 18syl333anc 1355 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝐹 𝐺) = (𝑆 𝑇))
2019eqcomd 2627 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑆 𝑇) = (𝐹 𝐺))
2120oveq1d 6619 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
22 simpl11 1134 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
23 simpl12 1135 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simpl13 1136 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
25 simpl21 1137 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
26 simpl22 1138 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑇𝐴 ∧ ¬ 𝑇 𝑊))
27 simpl23 1139 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑃𝑄𝑆𝑇))
28 simpl3l 1114 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑆 (𝑃 𝑄))
29 simpl3r 1115 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑇 (𝑃 𝑄))
30 simpr 477 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑈 (𝑆 𝑇))
3110, 11, 12, 13, 14, 15, 16, 17cdleme16g 35048 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄) ∧ ¬ 𝑈 (𝑆 𝑇))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
3222, 23, 24, 25, 26, 27, 28, 29, 30, 31syl333anc 1355 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
3321, 32pm2.61dan 831 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  w3a 1036   = wceq 1480  wcel 1987  wne 2790   class class class wbr 4613  cfv 5847  (class class class)co 6604  lecple 15869  joincjn 16865  meetcmee 16866  Atomscatm 34027  HLchlt 34114  LHypclh 34747
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-iun 4487  df-iin 4488  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-riota 6565  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-1st 7113  df-2nd 7114  df-preset 16849  df-poset 16867  df-plt 16879  df-lub 16895  df-glb 16896  df-join 16897  df-meet 16898  df-p0 16960  df-p1 16961  df-lat 16967  df-clat 17029  df-oposet 33940  df-ol 33942  df-oml 33943  df-covers 34030  df-ats 34031  df-atl 34062  df-cvlat 34086  df-hlat 34115  df-llines 34261  df-lplanes 34262  df-lvols 34263  df-lines 34264  df-psubsp 34266  df-pmap 34267  df-padd 34559  df-lhyp 34751
This theorem is referenced by:  cdleme19b  35069  cdleme20d  35077  cdleme22g  35113
  Copyright terms: Public domain W3C validator