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

Theorem cdleme36m 36066
 Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(x) is one-to-one on 𝑃 ∨ 𝑄 line. TODO: FIX COMMENT. (Contributed by NM, 11-Mar-2013.)
Hypotheses
Ref Expression
cdleme36.b 𝐵 = (Base‘𝐾)
cdleme36.l = (le‘𝐾)
cdleme36.j = (join‘𝐾)
cdleme36.m = (meet‘𝐾)
cdleme36.a 𝐴 = (Atoms‘𝐾)
cdleme36.h 𝐻 = (LHyp‘𝐾)
cdleme36.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme36.e 𝐸 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdleme36.v 𝑉 = ((𝑡 𝐸) 𝑊)
cdleme36.f 𝐹 = ((𝑅 𝑉) (𝐸 ((𝑡 𝑅) 𝑊)))
cdleme36.c 𝐶 = ((𝑆 𝑉) (𝐸 ((𝑡 𝑆) 𝑊)))
Assertion
Ref Expression
cdleme36m ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑅 = 𝑆)

Proof of Theorem cdleme36m
StepHypRef Expression
1 simp11 1111 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simp3rl 1154 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝑡𝐴 ∧ ¬ 𝑡 𝑊))
3 simp12 1112 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
4 simp13 1113 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
5 simp21 1114 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑃𝑄)
6 simp3rr 1155 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → ¬ 𝑡 (𝑃 𝑄))
7 cdleme36.l . . . . 5 = (le‘𝐾)
8 cdleme36.j . . . . 5 = (join‘𝐾)
9 cdleme36.m . . . . 5 = (meet‘𝐾)
10 cdleme36.a . . . . 5 𝐴 = (Atoms‘𝐾)
11 cdleme36.h . . . . 5 𝐻 = (LHyp‘𝐾)
12 cdleme36.u . . . . 5 𝑈 = ((𝑃 𝑄) 𝑊)
13 cdleme36.e . . . . 5 𝐸 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
147, 8, 9, 10, 11, 12, 13cdleme3fa 35841 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑡𝐴 ∧ ¬ 𝑡 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑡 (𝑃 𝑄))) → 𝐸𝐴)
151, 3, 4, 2, 5, 6, 14syl132anc 1384 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝐸𝐴)
167, 8, 9, 10, 11, 12, 13cdleme3 35842 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑡𝐴 ∧ ¬ 𝑡 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑡 (𝑃 𝑄))) → ¬ 𝐸 𝑊)
171, 3, 4, 2, 5, 6, 16syl132anc 1384 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → ¬ 𝐸 𝑊)
1815, 17jca 553 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝐸𝐴 ∧ ¬ 𝐸 𝑊))
19 simp13l 1196 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑄𝐴)
2019, 5jca 553 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝑄𝐴𝑃𝑄))
217, 8, 9, 10, 11, 12, 13cdleme3b 35834 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴𝑃𝑄) ∧ (𝑡𝐴 ∧ ¬ 𝑡 𝑊))) → 𝐸𝑡)
221, 3, 20, 2, 21syl13anc 1368 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝐸𝑡)
2322necomd 2878 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑡𝐸)
24 simp22 1115 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝑅𝐴 ∧ ¬ 𝑅 𝑊))
25 simp23 1116 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
26 simp3l1 1186 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑅 (𝑃 𝑄))
27 simp3r 1110 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))
28 cdleme36.b . . . 4 𝐵 = (Base‘𝐾)
2928, 7, 8, 9, 10, 11, 12, 13cdleme36a 36065 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ 𝑅 (𝑃 𝑄)) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄))) → ¬ 𝑅 (𝑡 𝐸))
301, 3, 19, 5, 24, 26, 27, 29syl331anc 1391 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → ¬ 𝑅 (𝑡 𝐸))
31 simp3l2 1187 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑆 (𝑃 𝑄))
3228, 7, 8, 9, 10, 11, 12, 13cdleme36a 36065 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴) ∧ (𝑃𝑄 ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ 𝑆 (𝑃 𝑄)) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄))) → ¬ 𝑆 (𝑡 𝐸))
331, 3, 19, 5, 25, 31, 27, 32syl331anc 1391 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → ¬ 𝑆 (𝑡 𝐸))
34 simp3l3 1188 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝐹 = 𝐶)
35 cdleme36.v . . 3 𝑉 = ((𝑡 𝐸) 𝑊)
36 cdleme36.f . . 3 𝐹 = ((𝑅 𝑉) (𝐸 ((𝑡 𝑅) 𝑊)))
37 cdleme36.c . . 3 𝐶 = ((𝑆 𝑉) (𝐸 ((𝑡 𝑆) 𝑊)))
387, 8, 9, 10, 11, 35, 36, 37cdleme35h 36061 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ (𝐸𝐴 ∧ ¬ 𝐸 𝑊)) ∧ (𝑡𝐸 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (¬ 𝑅 (𝑡 𝐸) ∧ ¬ 𝑆 (𝑡 𝐸) ∧ 𝐹 = 𝐶)) → 𝑅 = 𝑆)
391, 2, 18, 23, 24, 25, 30, 33, 34, 38syl333anc 1398 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝐹 = 𝐶) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)))) → 𝑅 = 𝑆)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030   ≠ wne 2823   class class class wbr 4685  ‘cfv 5926  (class class class)co 6690  Basecbs 15904  lecple 15995  joincjn 16991  meetcmee 16992  Atomscatm 34868  HLchlt 34955  LHypclh 35588 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-iun 4554  df-iin 4555  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-1st 7210  df-2nd 7211  df-preset 16975  df-poset 16993  df-plt 17005  df-lub 17021  df-glb 17022  df-join 17023  df-meet 17024  df-p0 17086  df-p1 17087  df-lat 17093  df-clat 17155  df-oposet 34781  df-ol 34783  df-oml 34784  df-covers 34871  df-ats 34872  df-atl 34903  df-cvlat 34927  df-hlat 34956  df-lines 35105  df-psubsp 35107  df-pmap 35108  df-padd 35400  df-lhyp 35592 This theorem is referenced by:  cdleme38m  36068
 Copyright terms: Public domain W3C validator