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 40526
Description: Lemma for dath 40572. 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 40520 . . . 4 (𝜓𝑑𝐴)
31dalemccea 40519 . . . 4 (𝜓𝑐𝐴)
42, 3jca 521 . . 3 (𝜓 → (𝑑𝐴𝑐𝐴))
543ad2ant3 1153 . 2 ((𝜑𝑌 = 𝑍𝜓) → (𝑑𝐴𝑐𝐴))
61dalem-ddly 40522 . . . 4 (𝜓 → ¬ 𝑑 𝑌)
763ad2ant3 1153 . . 3 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑑 𝑌)
8 simp2 1155 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → 𝑌 = 𝑍)
98breq2d 5123 . . 3 ((𝜑𝑌 = 𝑍𝜓) → (𝑑 𝑌𝑑 𝑍))
107, 9mtbid 327 . 2 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑑 𝑍)
111dalemccnedd 40523 . . . 4 (𝜓𝑐𝑑)
12113ad2ant3 1153 . . 3 ((𝜑𝑌 = 𝑍𝜓) → 𝑐𝑑)
131dalem-ccly 40521 . . . . 5 (𝜓 → ¬ 𝑐 𝑌)
14133ad2ant3 1153 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑐 𝑌)
158breq2d 5123 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → (𝑐 𝑌𝑐 𝑍))
1614, 15mtbid 327 . . 3 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑐 𝑍)
171dalemclccjdd 40524 . . . . 5 (𝜓𝐶 (𝑐 𝑑))
18173ad2ant3 1153 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → 𝐶 (𝑐 𝑑))
19 dalem.ph . . . . . . 7 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑆𝐴𝑇𝐴𝑈𝐴)) ∧ (𝑌𝑂𝑍𝑂) ∧ ((¬ 𝐶 (𝑃 𝑄) ∧ ¬ 𝐶 (𝑄 𝑅) ∧ ¬ 𝐶 (𝑅 𝑃)) ∧ (¬ 𝐶 (𝑆 𝑇) ∧ ¬ 𝐶 (𝑇 𝑈) ∧ ¬ 𝐶 (𝑈 𝑆)) ∧ (𝐶 (𝑃 𝑆) ∧ 𝐶 (𝑄 𝑇) ∧ 𝐶 (𝑅 𝑈)))))
2019dalemkehl 40459 . . . . . 6 (𝜑𝐾 ∈ HL)
21203ad2ant1 1151 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝐾 ∈ HL)
2233ad2ant3 1153 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝑐𝐴)
2323ad2ant3 1153 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝑑𝐴)
24 dalem.j . . . . . 6 = (join‘𝐾)
25 dalem.a . . . . . 6 𝐴 = (Atoms‘𝐾)
2624, 25hlatjcom 40204 . . . . 5 ((𝐾 ∈ HL ∧ 𝑐𝐴𝑑𝐴) → (𝑐 𝑑) = (𝑑 𝑐))
2721, 22, 23, 26syl3anc 1398 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → (𝑐 𝑑) = (𝑑 𝑐))
2818, 27breqtrd 5139 . . 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 2146  wne 2960   class class class wbr 5111  cfv 6540  (class class class)co 7419  Basecbs 17295  lecple 17343  joincjn 18393  Atomscatm 40099  HLchlt 40186
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-lub 18426  df-join 18428  df-lat 18514  df-ats 40103  df-atl 40134  df-cvlat 40158  df-hlat 40187
This theorem is used by:  dalem56  40564
  Copyright terms: Public domain W3C validator