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 40550
Description: Lemma for dath 40596. 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 40544 . . . 4 (𝜓𝑑𝐴)
31dalemccea 40543 . . . 4 (𝜓𝑐𝐴)
42, 3jca 521 . . 3 (𝜓 → (𝑑𝐴𝑐𝐴))
543ad2ant3 1153 . 2 ((𝜑𝑌 = 𝑍𝜓) → (𝑑𝐴𝑐𝐴))
61dalem-ddly 40546 . . . 4 (𝜓 → ¬ 𝑑 𝑌)
763ad2ant3 1153 . . 3 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑑 𝑌)
8 simp2 1155 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → 𝑌 = 𝑍)
98breq2d 5119 . . 3 ((𝜑𝑌 = 𝑍𝜓) → (𝑑 𝑌𝑑 𝑍))
107, 9mtbid 327 . 2 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑑 𝑍)
111dalemccnedd 40547 . . . 4 (𝜓𝑐𝑑)
12113ad2ant3 1153 . . 3 ((𝜑𝑌 = 𝑍𝜓) → 𝑐𝑑)
131dalem-ccly 40545 . . . . 5 (𝜓 → ¬ 𝑐 𝑌)
14133ad2ant3 1153 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑐 𝑌)
158breq2d 5119 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → (𝑐 𝑌𝑐 𝑍))
1614, 15mtbid 327 . . 3 ((𝜑𝑌 = 𝑍𝜓) → ¬ 𝑐 𝑍)
171dalemclccjdd 40548 . . . . 5 (𝜓𝐶 (𝑐 𝑑))
18173ad2ant3 1153 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → 𝐶 (𝑐 𝑑))
19 dalem.ph . . . . . . 7 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑆𝐴𝑇𝐴𝑈𝐴)) ∧ (𝑌𝑂𝑍𝑂) ∧ ((¬ 𝐶 (𝑃 𝑄) ∧ ¬ 𝐶 (𝑄 𝑅) ∧ ¬ 𝐶 (𝑅 𝑃)) ∧ (¬ 𝐶 (𝑆 𝑇) ∧ ¬ 𝐶 (𝑇 𝑈) ∧ ¬ 𝐶 (𝑈 𝑆)) ∧ (𝐶 (𝑃 𝑆) ∧ 𝐶 (𝑄 𝑇) ∧ 𝐶 (𝑅 𝑈)))))
2019dalemkehl 40483 . . . . . 6 (𝜑𝐾 ∈ HL)
21203ad2ant1 1151 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝐾 ∈ HL)
2233ad2ant3 1153 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝑐𝐴)
2323ad2ant3 1153 . . . . 5 ((𝜑𝑌 = 𝑍𝜓) → 𝑑𝐴)
24 dalem.j . . . . . 6 = (join‘𝐾)
25 dalem.a . . . . . 6 𝐴 = (Atoms‘𝐾)
2624, 25hlatjcom 40228 . . . . 5 ((𝐾 ∈ HL ∧ 𝑐𝐴𝑑𝐴) → (𝑐 𝑑) = (𝑑 𝑐))
2721, 22, 23, 26syl3anc 1398 . . . 4 ((𝜑𝑌 = 𝑍𝜓) → (𝑐 𝑑) = (𝑑 𝑐))
2818, 27breqtrd 5135 . . 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 2957   class class class wbr 5107  cfv 6537  (class class class)co 7416  Basecbs 17305  lecple 17353  joincjn 18403  Atomscatm 40123  HLchlt 40210
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-lub 18436  df-join 18438  df-lat 18524  df-ats 40127  df-atl 40158  df-cvlat 40182  df-hlat 40211
This theorem is used by:  dalem56  40588
  Copyright terms: Public domain W3C validator