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

Theorem cdleme0cq 41415
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 25-Apr-2013.)
Hypotheses
Ref Expression
cdleme0.l ≤ = (le‘𝐾)
cdleme0.j ∨ = (join‘𝐾)
cdleme0.m ∧ = (meet‘𝐾)
cdleme0.a 𝐴 = (Atoms‘𝐾)
cdleme0.h 𝐻 = (LHyp‘𝐾)
cdleme0.u 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
Assertion
Ref Expression
cdleme0cq (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑄 ∨ 𝑈) = (𝑃 ∨ 𝑄))

Proof of Theorem cdleme0cq
StepHypRef Expression
1 cdleme0.u . . 3 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
21oveq2i 7441 . 2 (𝑄 ∨ 𝑈) = (𝑄 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊))
3 simpll 779 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝐾 ∈ HL)
4 simprrl 793 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑄 ∈ 𝐴)
5 hllat 40563 . . . . . 6 (𝐾 ∈ HL → 𝐾 ∈ Lat)
65ad2antrr 739 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝐾 ∈ Lat)
7 eqid 2763 . . . . . . 7 (Base‘𝐾) = (Base‘𝐾)
8 cdleme0.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
97, 8atbase 40489 . . . . . 6 (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
109ad2antrl 741 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑃 ∈ (Base‘𝐾))
117, 8atbase 40489 . . . . . 6 (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
124, 11syl 18 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑄 ∈ (Base‘𝐾))
13 cdleme0.j . . . . . 6 ∨ = (join‘𝐾)
147, 13latjcl 18628 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
156, 10, 12, 14syl3anc 1398 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
16 cdleme0.h . . . . . 6 𝐻 = (LHyp‘𝐾)
177, 16lhpbase 41198 . . . . 5 (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
1817ad2antlr 740 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑊 ∈ (Base‘𝐾))
19 cdleme0.l . . . . . 6 ≤ = (le‘𝐾)
207, 19, 13latlej2 18638 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → 𝑄 ≤ (𝑃 ∨ 𝑄))
216, 10, 12, 20syl3anc 1398 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝑄 ≤ (𝑃 ∨ 𝑄))
22 cdleme0.m . . . . 5 ∧ = (meet‘𝐾)
237, 19, 13, 22, 8atmod3i1 41064 . . . 4 ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ 𝑄 ≤ (𝑃 ∨ 𝑄)) → (𝑄 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝑊)))
243, 4, 15, 18, 21, 23syl131anc 1410 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑄 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝑊)))
25 eqid 2763 . . . . . 6 (1.‘𝐾) = (1.‘𝐾)
2619, 13, 25, 8, 16lhpjat2 41221 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑄 ∨ 𝑊) = (1.‘𝐾))
2726adantrl 729 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑄 ∨ 𝑊) = (1.‘𝐾))
2827oveq2d 7446 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝑊)) = ((𝑃 ∨ 𝑄) ∧ (1.‘𝐾)))
29 hlol 40561 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ OL)
3029ad2antrr 739 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → 𝐾 ∈ OL)
317, 22, 25olm11 40427 . . . 4 ((𝐾 ∈ OL ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑄) ∧ (1.‘𝐾)) = (𝑃 ∨ 𝑄))
3230, 15, 31syl2anc 596 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝑃 ∨ 𝑄) ∧ (1.‘𝐾)) = (𝑃 ∨ 𝑄))
3324, 28, 323eqtrd 2802 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑄 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) = (𝑃 ∨ 𝑄))
342, 33eqtrid 2810 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝑄 ∨ 𝑈) = (𝑃 ∨ 𝑄))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146   class class class wbr 5106  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  lecple 17450  joincjn 18500  meetcmee 18501  1.cp1 18611  Latclat 18620  OLcol 40374  Atomscatm 40463  HLchlt 40550  LHypclh 41184
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-iin 4957  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-mpo 7435  df-1st 8011  df-2nd 8012  df-proset 18483  df-poset 18502  df-plt 18517  df-lub 18533  df-glb 18534  df-join 18535  df-meet 18536  df-p0 18612  df-p1 18613  df-lat 18621  df-clat 18688  df-oposet 40376  df-ol 40378  df-oml 40379  df-covers 40466  df-ats 40467  df-atl 40498  df-cvlat 40522  df-hlat 40551  df-psubsp 40703  df-pmap 40704  df-padd 40996  df-lhyp 41188
This theorem is used by:  cdleme11g  41465  cdlemg4b2  41810  cdlemg13a  41851
  Copyright terms: Public domain W3C validator