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

Theorem cdleme39n 37469
Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(x) is one-to-one on 𝑃 𝑄 line. TODO: FIX COMMENT. 𝐸, 𝑌, 𝐺, 𝑍 serve as f(t), f(u), ft(𝑅), ft(𝑆). Put hypotheses of cdleme38n 37467 in convention of cdleme32sn1awN 37435. TODO see if this hypothesis conversion would be better if done earlier. (Contributed by NM, 15-Mar-2013.)
Hypotheses
Ref Expression
cdleme39.l = (le‘𝐾)
cdleme39.j = (join‘𝐾)
cdleme39.m = (meet‘𝐾)
cdleme39.a 𝐴 = (Atoms‘𝐾)
cdleme39.h 𝐻 = (LHyp‘𝐾)
cdleme39.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme39.e 𝐸 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdleme39.g 𝐺 = ((𝑃 𝑄) (𝐸 ((𝑅 𝑡) 𝑊)))
cdleme39.y 𝑌 = ((𝑢 𝑈) (𝑄 ((𝑃 𝑢) 𝑊)))
cdleme39.z 𝑍 = ((𝑃 𝑄) (𝑌 ((𝑆 𝑢) 𝑊)))
Assertion
Ref Expression
cdleme39n ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝐺𝑍)

Proof of Theorem cdleme39n
StepHypRef Expression
1 cdleme39.l . . 3 = (le‘𝐾)
2 cdleme39.j . . 3 = (join‘𝐾)
3 cdleme39.m . . 3 = (meet‘𝐾)
4 cdleme39.a . . 3 𝐴 = (Atoms‘𝐾)
5 cdleme39.h . . 3 𝐻 = (LHyp‘𝐾)
6 cdleme39.u . . 3 𝑈 = ((𝑃 𝑄) 𝑊)
7 cdleme39.e . . 3 𝐸 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
8 cdleme39.y . . 3 𝑌 = ((𝑢 𝑈) (𝑄 ((𝑃 𝑢) 𝑊)))
9 eqid 2825 . . 3 ((𝑡 𝐸) 𝑊) = ((𝑡 𝐸) 𝑊)
10 eqid 2825 . . 3 ((𝑢 𝑌) 𝑊) = ((𝑢 𝑌) 𝑊)
11 eqid 2825 . . 3 ((𝑅 ((𝑡 𝐸) 𝑊)) (𝐸 ((𝑡 𝑅) 𝑊))) = ((𝑅 ((𝑡 𝐸) 𝑊)) (𝐸 ((𝑡 𝑅) 𝑊)))
12 eqid 2825 . . 3 ((𝑆 ((𝑢 𝑌) 𝑊)) (𝑌 ((𝑢 𝑆) 𝑊))) = ((𝑆 ((𝑢 𝑌) 𝑊)) (𝑌 ((𝑢 𝑆) 𝑊)))
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12cdleme38n 37467 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → ((𝑅 ((𝑡 𝐸) 𝑊)) (𝐸 ((𝑡 𝑅) 𝑊))) ≠ ((𝑆 ((𝑢 𝑌) 𝑊)) (𝑌 ((𝑢 𝑆) 𝑊))))
14 simp11 1197 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
15 simp12l 1280 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑃𝐴)
16 simp13l 1282 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑄𝐴)
17 simp22l 1286 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑅𝐴)
18 simp22r 1287 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → ¬ 𝑅 𝑊)
19 simp311 1314 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑅 (𝑃 𝑄))
20 simp32l 1292 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → (𝑡𝐴 ∧ ¬ 𝑡 𝑊))
21 cdleme39.g . . . 4 𝐺 = ((𝑃 𝑄) (𝐸 ((𝑅 𝑡) 𝑊)))
221, 2, 3, 4, 5, 6, 7, 21, 9cdleme39a 37468 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝑃𝐴𝑄𝐴) ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑅 (𝑃 𝑄) ∧ (𝑡𝐴 ∧ ¬ 𝑡 𝑊))) → 𝐺 = ((𝑅 ((𝑡 𝐸) 𝑊)) (𝐸 ((𝑡 𝑅) 𝑊))))
2314, 15, 16, 17, 18, 19, 20, 22syl322anc 1392 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝐺 = ((𝑅 ((𝑡 𝐸) 𝑊)) (𝐸 ((𝑡 𝑅) 𝑊))))
24 simp23l 1288 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑆𝐴)
25 simp23r 1289 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → ¬ 𝑆 𝑊)
26 simp312 1315 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑆 (𝑃 𝑄))
27 simp33l 1294 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → (𝑢𝐴 ∧ ¬ 𝑢 𝑊))
28 cdleme39.z . . . 4 𝑍 = ((𝑃 𝑄) (𝑌 ((𝑆 𝑢) 𝑊)))
291, 2, 3, 4, 5, 6, 8, 28, 10cdleme39a 37468 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝑃𝐴𝑄𝐴) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑆 (𝑃 𝑄) ∧ (𝑢𝐴 ∧ ¬ 𝑢 𝑊))) → 𝑍 = ((𝑆 ((𝑢 𝑌) 𝑊)) (𝑌 ((𝑢 𝑆) 𝑊))))
3014, 15, 16, 24, 25, 26, 27, 29syl322anc 1392 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝑍 = ((𝑆 ((𝑢 𝑌) 𝑊)) (𝑌 ((𝑢 𝑆) 𝑊))))
3113, 23, 303netr4d 3097 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ((𝑅 (𝑃 𝑄) ∧ 𝑆 (𝑃 𝑄) ∧ 𝑅𝑆) ∧ ((𝑡𝐴 ∧ ¬ 𝑡 𝑊) ∧ ¬ 𝑡 (𝑃 𝑄)) ∧ ((𝑢𝐴 ∧ ¬ 𝑢 𝑊) ∧ ¬ 𝑢 (𝑃 𝑄)))) → 𝐺𝑍)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1081   = wceq 1530  wcel 2107  wne 3020   class class class wbr 5062  cfv 6351  (class class class)co 7151  lecple 16564  joincjn 17546  meetcmee 17547  Atomscatm 36266  HLchlt 36353  LHypclh 36987
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2797  ax-rep 5186  ax-sep 5199  ax-nul 5206  ax-pow 5262  ax-pr 5325  ax-un 7454
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2619  df-eu 2651  df-clab 2804  df-cleq 2818  df-clel 2897  df-nfc 2967  df-ne 3021  df-ral 3147  df-rex 3148  df-reu 3149  df-rab 3151  df-v 3501  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4470  df-pw 4543  df-sn 4564  df-pr 4566  df-op 4570  df-uni 4837  df-iun 4918  df-iin 4919  df-br 5063  df-opab 5125  df-mpt 5143  df-id 5458  df-xp 5559  df-rel 5560  df-cnv 5561  df-co 5562  df-dm 5563  df-rn 5564  df-res 5565  df-ima 5566  df-iota 6311  df-fun 6353  df-fn 6354  df-f 6355  df-f1 6356  df-fo 6357  df-f1o 6358  df-fv 6359  df-riota 7109  df-ov 7154  df-oprab 7155  df-mpo 7156  df-1st 7683  df-2nd 7684  df-proset 17530  df-poset 17548  df-plt 17560  df-lub 17576  df-glb 17577  df-join 17578  df-meet 17579  df-p0 17641  df-p1 17642  df-lat 17648  df-clat 17710  df-oposet 36179  df-ol 36181  df-oml 36182  df-covers 36269  df-ats 36270  df-atl 36301  df-cvlat 36325  df-hlat 36354  df-llines 36501  df-lplanes 36502  df-lvols 36503  df-lines 36504  df-psubsp 36506  df-pmap 36507  df-padd 36799  df-lhyp 36991
This theorem is referenced by:  cdleme40m  37470
  Copyright terms: Public domain W3C validator