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

Theorem dalem62 36737
 Description: Lemma for dath 36739. Eliminate the condition 𝜓 containing dummy variables 𝑐 and 𝑑. (Contributed by NM, 11-Aug-2012.)
Hypotheses
Ref Expression
dalem62.ph (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑆𝐴𝑇𝐴𝑈𝐴)) ∧ (𝑌𝑂𝑍𝑂) ∧ ((¬ 𝐶 (𝑃 𝑄) ∧ ¬ 𝐶 (𝑄 𝑅) ∧ ¬ 𝐶 (𝑅 𝑃)) ∧ (¬ 𝐶 (𝑆 𝑇) ∧ ¬ 𝐶 (𝑇 𝑈) ∧ ¬ 𝐶 (𝑈 𝑆)) ∧ (𝐶 (𝑃 𝑆) ∧ 𝐶 (𝑄 𝑇) ∧ 𝐶 (𝑅 𝑈)))))
dalem62.l = (le‘𝐾)
dalem62.j = (join‘𝐾)
dalem62.a 𝐴 = (Atoms‘𝐾)
dalem62.m = (meet‘𝐾)
dalem62.o 𝑂 = (LPlanes‘𝐾)
dalem62.y 𝑌 = ((𝑃 𝑄) 𝑅)
dalem62.z 𝑍 = ((𝑆 𝑇) 𝑈)
dalem62.d 𝐷 = ((𝑃 𝑄) (𝑆 𝑇))
dalem62.e 𝐸 = ((𝑄 𝑅) (𝑇 𝑈))
dalem62.f 𝐹 = ((𝑅 𝑃) (𝑈 𝑆))
Assertion
Ref Expression
dalem62 ((𝜑𝑌 = 𝑍) → 𝐹 (𝐷 𝐸))

Proof of Theorem dalem62
Dummy variables 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dalem62.ph . . 3 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ (𝑆𝐴𝑇𝐴𝑈𝐴)) ∧ (𝑌𝑂𝑍𝑂) ∧ ((¬ 𝐶 (𝑃 𝑄) ∧ ¬ 𝐶 (𝑄 𝑅) ∧ ¬ 𝐶 (𝑅 𝑃)) ∧ (¬ 𝐶 (𝑆 𝑇) ∧ ¬ 𝐶 (𝑇 𝑈) ∧ ¬ 𝐶 (𝑈 𝑆)) ∧ (𝐶 (𝑃 𝑆) ∧ 𝐶 (𝑄 𝑇) ∧ 𝐶 (𝑅 𝑈)))))
2 dalem62.l . . 3 = (le‘𝐾)
3 dalem62.j . . 3 = (join‘𝐾)
4 dalem62.a . . 3 𝐴 = (Atoms‘𝐾)
5 biid 262 . . 3 (((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))) ↔ ((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))))
6 dalem62.o . . 3 𝑂 = (LPlanes‘𝐾)
7 dalem62.y . . 3 𝑌 = ((𝑃 𝑄) 𝑅)
8 dalem62.z . . 3 𝑍 = ((𝑆 𝑇) 𝑈)
91, 2, 3, 4, 5, 6, 7, 8dalem20 36696 . 2 ((𝜑𝑌 = 𝑍) → ∃𝑐𝑑((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))))
10 dalem62.m . . . . 5 = (meet‘𝐾)
11 dalem62.d . . . . 5 𝐷 = ((𝑃 𝑄) (𝑆 𝑇))
12 dalem62.e . . . . 5 𝐸 = ((𝑄 𝑅) (𝑇 𝑈))
13 dalem62.f . . . . 5 𝐹 = ((𝑅 𝑃) (𝑈 𝑆))
141, 2, 3, 4, 5, 10, 6, 7, 8, 11, 12, 13dalem61 36736 . . . 4 ((𝜑𝑌 = 𝑍 ∧ ((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑)))) → 𝐹 (𝐷 𝐸))
15143expia 1115 . . 3 ((𝜑𝑌 = 𝑍) → (((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))) → 𝐹 (𝐷 𝐸)))
1615exlimdvv 1928 . 2 ((𝜑𝑌 = 𝑍) → (∃𝑐𝑑((𝑐𝐴𝑑𝐴) ∧ ¬ 𝑐 𝑌 ∧ (𝑑𝑐 ∧ ¬ 𝑑 𝑌𝐶 (𝑐 𝑑))) → 𝐹 (𝐷 𝐸)))
179, 16mpd 15 1 ((𝜑𝑌 = 𝑍) → 𝐹 (𝐷 𝐸))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1081   = wceq 1530  ∃wex 1773   ∈ wcel 2107   ≠ wne 3020   class class class wbr 5062  ‘cfv 6351  (class class class)co 7151  Basecbs 16475  lecple 16564  joincjn 17546  meetcmee 17547  Atomscatm 36266  HLchlt 36353  LPlanesclpl 36495 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-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-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 This theorem is referenced by:  dalem63  36738
 Copyright terms: Public domain W3C validator