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

Theorem dalem12 40875
Description: Lemma for dath 40936. Analogue of dalem10 40873 for 𝐹. (Contributed by NM, 11-Aug-2012.)
Hypotheses
Ref Expression
dalema.ph (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
dalemc.l ≤ = (le‘𝐾)
dalemc.j ∨ = (join‘𝐾)
dalemc.a 𝐴 = (Atoms‘𝐾)
dalem12.m ∧ = (meet‘𝐾)
dalem12.o 𝑂 = (LPlanes‘𝐾)
dalem12.y 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
dalem12.z 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
dalem12.x 𝑋 = (𝑌 ∧ 𝑍)
dalem12.f 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
Assertion
Ref Expression
dalem12 (𝜑 → 𝐹 ≤ 𝑋)

Proof of Theorem dalem12
StepHypRef Expression
1 dalema.ph . . . 4 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
2 dalemc.l . . . 4 ≤ = (le‘𝐾)
3 dalemc.j . . . 4 ∨ = (join‘𝐾)
4 dalemc.a . . . 4 𝐴 = (Atoms‘𝐾)
5 dalem12.y . . . 4 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
6 dalem12.z . . . 4 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
71, 2, 3, 4, 5, 6dalemrot 40857 . . 3 (𝜑 → (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ (((𝑄 ∨ 𝑅) ∨ 𝑃) ∈ 𝑂 ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃) ∧ ¬ 𝐶 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆) ∧ ¬ 𝐶 ≤ (𝑆 ∨ 𝑇)) ∧ (𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈) ∧ 𝐶 ≤ (𝑃 ∨ 𝑆)))))
8 biid 264 . . . 4 ((((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ (((𝑄 ∨ 𝑅) ∨ 𝑃) ∈ 𝑂 ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃) ∧ ¬ 𝐶 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆) ∧ ¬ 𝐶 ≤ (𝑆 ∨ 𝑇)) ∧ (𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈) ∧ 𝐶 ≤ (𝑃 ∨ 𝑆)))) ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ (((𝑄 ∨ 𝑅) ∨ 𝑃) ∈ 𝑂 ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃) ∧ ¬ 𝐶 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆) ∧ ¬ 𝐶 ≤ (𝑆 ∨ 𝑇)) ∧ (𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈) ∧ 𝐶 ≤ (𝑃 ∨ 𝑆)))))
9 dalem12.m . . . 4 ∧ = (meet‘𝐾)
10 dalem12.o . . . 4 𝑂 = (LPlanes‘𝐾)
11 eqid 2763 . . . 4 ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑄 ∨ 𝑅) ∨ 𝑃)
12 eqid 2763 . . . 4 ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑇 ∨ 𝑈) ∨ 𝑆)
13 eqid 2763 . . . 4 (((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆)) = (((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆))
14 dalem12.f . . . 4 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
158, 2, 3, 4, 9, 10, 11, 12, 13, 14dalem11 40874 . . 3 ((((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ (((𝑄 ∨ 𝑅) ∨ 𝑃) ∈ 𝑂 ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃) ∧ ¬ 𝐶 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆) ∧ ¬ 𝐶 ≤ (𝑆 ∨ 𝑇)) ∧ (𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈) ∧ 𝐶 ≤ (𝑃 ∨ 𝑆)))) → 𝐹 ≤ (((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆)))
167, 15syl 18 . 2 (𝜑 → 𝐹 ≤ (((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆)))
17 dalem12.x . . 3 𝑋 = (𝑌 ∧ 𝑍)
181, 3, 4dalemqrprot 40848 . . . . 5 (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅))
195, 18eqtr4id 2817 . . . 4 (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃))
201dalemkehl 40823 . . . . . 6 (𝜑 → 𝐾 ∈ HL)
211dalemtea 40830 . . . . . 6 (𝜑 → 𝑇 ∈ 𝐴)
221dalemuea 40831 . . . . . 6 (𝜑 → 𝑈 ∈ 𝐴)
231dalemsea 40829 . . . . . 6 (𝜑 → 𝑆 ∈ 𝐴)
243, 4hlatjrot 40573 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈))
2520, 21, 22, 23, 24syl13anc 1399 . . . . 5 (𝜑 → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈))
266, 25eqtr4id 2817 . . . 4 (𝜑 → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆))
2719, 26oveq12d 7448 . . 3 (𝜑 → (𝑌 ∧ 𝑍) = (((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆)))
2817, 27eqtrid 2810 . 2 (𝜑 → 𝑋 = (((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ ((𝑇 ∨ 𝑈) ∨ 𝑆)))
2916, 28breqtrrd 5136 1 (𝜑 → 𝐹 ≤ 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   class class class wbr 5106  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  lecple 17450  joincjn 18500  meetcmee 18501  Atomscatm 40463  HLchlt 40550  LPlanesclpl 40692
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-proset 18483  df-poset 18502  df-lub 18533  df-glb 18534  df-join 18535  df-meet 18536  df-lat 18621  df-ats 40467  df-atl 40498  df-cvlat 40522  df-hlat 40551  df-lplanes 40699
This theorem is used by:  dalem16  40879
  Copyright terms: Public domain W3C validator