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

Theorem dalem48 40968
Description: Lemma for dath 40984. Analogue of dalem45 40965 for 𝑃𝑄. (Contributed by NM, 16-Aug-2012.)
Hypotheses
Ref Expression
dalem.ph (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
dalem.l ≤ = (le‘𝐾)
dalem.j ∨ = (join‘𝐾)
dalem.a 𝐴 = (Atoms‘𝐾)
dalem.ps (𝜓 ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))))
dalem44.m ∧ = (meet‘𝐾)
dalem44.o 𝑂 = (LPlanes‘𝐾)
dalem44.y 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
dalem44.z 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
dalem44.g 𝐺 = ((𝑐 ∨ 𝑃) ∧ (𝑑 ∨ 𝑆))
dalem44.h 𝐻 = ((𝑐 ∨ 𝑄) ∧ (𝑑 ∨ 𝑇))
dalem44.i 𝐼 = ((𝑐 ∨ 𝑅) ∧ (𝑑 ∨ 𝑈))
Assertion
Ref Expression
dalem48 ((𝜑 ∧ 𝜓) → ¬ 𝑐 ≤ (𝑃 ∨ 𝑄))

Proof of Theorem dalem48
StepHypRef Expression
1 dalem.ph . . . 4 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
21dalemkelat 40872 . . 3 (𝜑 → 𝐾 ∈ Lat)
32adantr 486 . 2 ((𝜑 ∧ 𝜓) → 𝐾 ∈ Lat)
4 dalem.ps . . . 4 (𝜓 ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))))
5 dalem.a . . . 4 𝐴 = (Atoms‘𝐾)
64, 5dalemcceb 40937 . . 3 (𝜓 → 𝑐 ∈ (Base‘𝐾))
76adantl 487 . 2 ((𝜑 ∧ 𝜓) → 𝑐 ∈ (Base‘𝐾))
8 dalem.j . . . 4 ∨ = (join‘𝐾)
91, 8, 5dalempjqeb 40893 . . 3 (𝜑 → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
109adantr 486 . 2 ((𝜑 ∧ 𝜓) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
111, 5dalemreb 40889 . . 3 (𝜑 → 𝑅 ∈ (Base‘𝐾))
1211adantr 486 . 2 ((𝜑 ∧ 𝜓) → 𝑅 ∈ (Base‘𝐾))
134dalem-ccly 40933 . . . 4 (𝜓 → ¬ 𝑐 ≤ 𝑌)
14 dalem44.y . . . . 5 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
1514breq2i 5114 . . . 4 (𝑐 ≤ 𝑌 ↔ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))
1613, 15sylnib 331 . . 3 (𝜓 → ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))
1716adantl 487 . 2 ((𝜑 ∧ 𝜓) → ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅))
18 eqid 2763 . . 3 (Base‘𝐾) = (Base‘𝐾)
19 dalem.l . . 3 ≤ = (le‘𝐾)
2018, 19, 8latnlej2l 18660 . 2 ((𝐾 ∈ Lat ∧ (𝑐 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) ∧ ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) → ¬ 𝑐 ≤ (𝑃 ∨ 𝑄))
213, 7, 10, 12, 17, 20syl131anc 1411 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 2147   ≠ wne 2959   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  lecple 17461  joincjn 18511  meetcmee 18512  Latclat 18631  Atomscatm 40511  HLchlt 40598  LPlanesclpl 40740
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-poset 18513  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-lat 18632  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599
This theorem is used by:  dalem49  40969  dalem51  40971  dalem52  40972
  Copyright terms: Public domain W3C validator