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 38041
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 1250 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simpl12 1251 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
3 simpl13 1252 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
4 simpl21 1253 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
5 simpl22 1254 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑇𝐴 ∧ ¬ 𝑇 𝑊))
6 simpl23 1255 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑃𝑄𝑆𝑇))
7 simpl3l 1230 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ¬ 𝑆 (𝑃 𝑄))
8 simpl3r 1231 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ¬ 𝑇 (𝑃 𝑄))
9 simpr 488 . . . . 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 38026 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄) ∧ 𝑈 (𝑆 𝑇))) → (𝐹 𝐺) = (𝑆 𝑇))
191, 2, 3, 4, 5, 6, 7, 8, 9, 18syl333anc 1404 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝐹 𝐺) = (𝑆 𝑇))
2019eqcomd 2743 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → (𝑆 𝑇) = (𝐹 𝐺))
2120oveq1d 7233 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ 𝑈 (𝑆 𝑇)) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
22 simpl11 1250 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
23 simpl12 1251 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simpl13 1252 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
25 simpl21 1253 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
26 simpl22 1254 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑇𝐴 ∧ ¬ 𝑇 𝑊))
27 simpl23 1255 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → (𝑃𝑄𝑆𝑇))
28 simpl3l 1230 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑆 (𝑃 𝑄))
29 simpl3r 1231 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑇 (𝑃 𝑄))
30 simpr 488 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ¬ 𝑈 (𝑆 𝑇))
3110, 11, 12, 13, 14, 15, 16, 17cdleme16g 38040 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄) ∧ ¬ 𝑈 (𝑆 𝑇))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
3222, 23, 24, 25, 26, 27, 28, 29, 30, 31syl333anc 1404 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) ∧ ¬ 𝑈 (𝑆 𝑇)) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
3321, 32pm2.61dan 813 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ (𝑃𝑄𝑆𝑇)) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄))) → ((𝑆 𝑇) 𝑊) = ((𝐹 𝐺) 𝑊))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  wne 2940   class class class wbr 5058  cfv 6385  (class class class)co 7218  lecple 16814  joincjn 17823  meetcmee 17824  Atomscatm 37019  HLchlt 37106  LHypclh 37740
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5184  ax-sep 5197  ax-nul 5204  ax-pow 5263  ax-pr 5327  ax-un 7528
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3415  df-sbc 3700  df-csb 3817  df-dif 3874  df-un 3876  df-in 3878  df-ss 3888  df-nul 4243  df-if 4445  df-pw 4520  df-sn 4547  df-pr 4549  df-op 4553  df-uni 4825  df-iun 4911  df-iin 4912  df-br 5059  df-opab 5121  df-mpt 5141  df-id 5460  df-xp 5562  df-rel 5563  df-cnv 5564  df-co 5565  df-dm 5566  df-rn 5567  df-res 5568  df-ima 5569  df-iota 6343  df-fun 6387  df-fn 6388  df-f 6389  df-f1 6390  df-fo 6391  df-f1o 6392  df-fv 6393  df-riota 7175  df-ov 7221  df-oprab 7222  df-mpo 7223  df-1st 7766  df-2nd 7767  df-proset 17807  df-poset 17825  df-plt 17841  df-lub 17857  df-glb 17858  df-join 17859  df-meet 17860  df-p0 17936  df-p1 17937  df-lat 17943  df-clat 18010  df-oposet 36932  df-ol 36934  df-oml 36935  df-covers 37022  df-ats 37023  df-atl 37054  df-cvlat 37078  df-hlat 37107  df-llines 37254  df-lplanes 37255  df-lvols 37256  df-lines 37257  df-psubsp 37259  df-pmap 37260  df-padd 37552  df-lhyp 37744
This theorem is referenced by:  cdleme19b  38060  cdleme20d  38068  cdleme22g  38104
  Copyright terms: Public domain W3C validator