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

Theorem dalemswapyzps 40566
Description: Lemma for dath 40612. Swap the 𝑌 and 𝑍 planes, along with dummy concurrency (center of perspectivity) atoms 𝑐 and 𝑑, to allow reuse of analogous proofs. (Contributed by NM, 17-Aug-2012.)
Hypotheses
Ref Expression
dalem.ph (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑆𝐴𝑇𝐴𝑈𝐴)) ∧ (𝑌𝑂𝑍𝑂) ∧ ((¬ 𝐶 (𝑃 𝑄) ∧ ¬ 𝐶 (𝑄 𝑅) ∧ ¬ 𝐶 (𝑅 𝑃)) ∧ (¬ 𝐶 (𝑆 𝑇) ∧ ¬ 𝐶 (𝑇 𝑈) ∧ ¬ 𝐶 (𝑈 𝑆)) ∧ (𝐶 (𝑃 𝑆) ∧ 𝐶 (𝑄 𝑇) ∧ 𝐶 (𝑅 𝑈)))))
dalem.l = (le‘𝐾)
dalem.j = (join‘𝐾)
dalem.a 𝐴 = (Atoms‘𝐾)
dalem.ps (𝜓 ↔ ((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))))
Assertion
Ref Expression
dalemswapyzps ((𝜑𝑌 = 𝑍𝜓) → ((𝑑𝐴𝑐𝐴) ∧ ¬ 𝑑 𝑍 ∧ (𝑐𝑑 ∧ ¬ 𝑐 𝑍𝐶 (𝑑 𝑐))))

Proof of Theorem dalemswapyzps
StepHypRef Expression
1 dalem.ps . . . . 5 (𝜓 ↔ ((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))))
21dalemddea 40560 . . . 4 (𝜓𝑑𝐴)
31dalemccea 40559 . . . 4 (𝜓𝑐𝐴)
42, 3jca 521 . . 3 (𝜓 → (𝑑𝐴𝑐𝐴))
543ad2ant3 1153 . 2 ((𝜑𝑌 = 𝑍𝜓) → (𝑑𝐴𝑐𝐴))
61dalem-ddly 40562 . . . 4 (𝜓 → ¬ 𝑑 𝑌)
763ad2ant3 1153 . . 3 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑑 𝑌)
8 simp2 1155 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → 𝑌 = 𝑍)
98breq2d 5115 . . 3 ((𝜑𝑌 = 𝑍𝜓) → (𝑑 𝑌𝑑 𝑍))
107, 9mtbid 327 . 2 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑑 𝑍)
111dalemccnedd 40563 . . . 4 (𝜓𝑐𝑑)
12113ad2ant3 1153 . . 3 ((𝜑𝑌 = 𝑍𝜓) → 𝑐𝑑)
131dalem-ccly 40561 . . . . 5 (𝜓 → ¬ 𝑐 𝑌)
14133ad2ant3 1153 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑐 𝑌)
158breq2d 5115 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → (𝑐 𝑌𝑐 𝑍))
1614, 15mtbid 327 . . 3 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑐 𝑍)
171dalemclccjdd 40564 . . . . 5 (𝜓𝐶 (𝑐 𝑑))
18173ad2ant3 1153 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → 𝐶 (𝑐 𝑑))
19 dalem.ph . . . . . . 7 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑆𝐴𝑇𝐴𝑈𝐴)) ∧ (𝑌𝑂𝑍𝑂) ∧ ((¬ 𝐶 (𝑃 𝑄) ∧ ¬ 𝐶 (𝑄 𝑅) ∧ ¬ 𝐶 (𝑅 𝑃)) ∧ (¬ 𝐶 (𝑆 𝑇) ∧ ¬ 𝐶 (𝑇 𝑈) ∧ ¬ 𝐶 (𝑈 𝑆)) ∧ (𝐶 (𝑃 𝑆) ∧ 𝐶 (𝑄 𝑇) ∧ 𝐶 (𝑅 𝑈)))))
2019dalemkehl 40499 . . . . . 6 (𝜑𝐾 ∈ HL)
21203ad2ant1 1151 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝐾 ∈ HL)
2233ad2ant3 1153 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝑐𝐴)
2323ad2ant3 1153 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝑑𝐴)
24 dalem.j . . . . . 6 = (join‘𝐾)
25 dalem.a . . . . . 6 𝐴 = (Atoms‘𝐾)
2624, 25hlatjcom 40244 . . . . 5 ((𝐾 ∈ HL ∧ 𝑐𝐴𝑑𝐴) → (𝑐 𝑑) = (𝑑 𝑐))
2721, 22, 23, 26syl3anc 1398 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → (𝑐 𝑑) = (𝑑 𝑐))
2818, 27breqtrd 5131 . . 3 ((𝜑𝑌 = 𝑍𝜓) → 𝐶 (𝑑 𝑐))
2912, 16, 283jca 1146 . 2 ((𝜑𝑌 = 𝑍𝜓) → (𝑐𝑑 ∧ ¬ 𝑐 𝑍𝐶 (𝑑 𝑐)))
305, 10, 293jca 1146 1 ((𝜑𝑌 = 𝑍𝜓) → ((𝑑𝐴𝑐𝐴) ∧ ¬ 𝑑 𝑍 ∧ (𝑐𝑑 ∧ ¬ 𝑐 𝑍𝐶 (𝑑 𝑐))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wne 2955   class class class wbr 5103  cfv 6533  (class class class)co 7414  Basecbs 17304  lecple 17352  joincjn 18402  Atomscatm 40139  HLchlt 40226
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-lub 18435  df-join 18437  df-lat 18523  df-ats 40143  df-atl 40174  df-cvlat 40198  df-hlat 40227
This theorem is used by:  dalem56  40604
  Copyright terms: Public domain W3C validator