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

Theorem lhpmcvr3 41189
Description: Specialization of lhpmcvr2 41188. TODO: Use this to simplify many uses of (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋 to become 𝑃 ≤ 𝑋. (Contributed by NM, 6-Apr-2014.)
Hypotheses
Ref Expression
lhpmcvr2.b 𝐵 = (Base‘𝐾)
lhpmcvr2.l ≤ = (le‘𝐾)
lhpmcvr2.j ∨ = (join‘𝐾)
lhpmcvr2.m ∧ = (meet‘𝐾)
lhpmcvr2.a 𝐴 = (Atoms‘𝐾)
lhpmcvr2.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
lhpmcvr3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ≤ 𝑋 ↔ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋))

Proof of Theorem lhpmcvr3
StepHypRef Expression
1 simpl1l 1243 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝐾 ∈ HL)
2 simpl3l 1247 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝑃 ∈ 𝐴)
3 simpl2l 1245 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝑋 ∈ 𝐵)
4 simpl1r 1244 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝑊 ∈ 𝐻)
5 lhpmcvr2.b . . . . . 6 𝐵 = (Base‘𝐾)
6 lhpmcvr2.h . . . . . 6 𝐻 = (LHyp‘𝐾)
75, 6lhpbase 41162 . . . . 5 (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵)
84, 7syl 18 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝑊 ∈ 𝐵)
9 simpr 490 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝑃 ≤ 𝑋)
10 lhpmcvr2.l . . . . 5 ≤ = (le‘𝐾)
11 lhpmcvr2.j . . . . 5 ∨ = (join‘𝐾)
12 lhpmcvr2.m . . . . 5 ∧ = (meet‘𝐾)
13 lhpmcvr2.a . . . . 5 𝐴 = (Atoms‘𝐾)
145, 10, 11, 12, 13atmod3i1 41028 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑋 ∧ 𝑊)) = (𝑋 ∧ (𝑃 ∨ 𝑊)))
151, 2, 3, 8, 9, 14syl131anc 1410 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑋 ∧ 𝑊)) = (𝑋 ∧ (𝑃 ∨ 𝑊)))
16 simpl1 1210 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17 simpl3 1212 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
18 eqid 2760 . . . . . 6 (1.‘𝐾) = (1.‘𝐾)
1910, 11, 18, 13, 6lhpjat2 41185 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ 𝑊) = (1.‘𝐾))
2016, 17, 19syl2anc 596 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ 𝑊) = (1.‘𝐾))
2120oveq2d 7438 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝑋 ∧ (𝑃 ∨ 𝑊)) = (𝑋 ∧ (1.‘𝐾)))
22 hlol 40525 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ OL)
231, 22syl 18 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → 𝐾 ∈ OL)
245, 12, 18olm11 40391 . . . 4 ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∧ (1.‘𝐾)) = 𝑋)
2523, 3, 24syl2anc 596 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝑋 ∧ (1.‘𝐾)) = 𝑋)
2615, 21, 253eqtrd 2799 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)
27 simpl1l 1243 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝐾 ∈ HL)
2827hllatd 40528 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝐾 ∈ Lat)
29 simpl3l 1247 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑃 ∈ 𝐴)
305, 13atbase 40453 . . . . 5 (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
3129, 30syl 18 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑃 ∈ 𝐵)
32 simpl2l 1245 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑋 ∈ 𝐵)
33 simpl1r 1244 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑊 ∈ 𝐻)
3433, 7syl 18 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑊 ∈ 𝐵)
355, 12latmcl 18621 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵)
3628, 32, 34, 35syl3anc 1398 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → (𝑋 ∧ 𝑊) ∈ 𝐵)
375, 10, 11latlej1 18629 . . . 4 ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ (𝑋 ∧ 𝑊) ∈ 𝐵) → 𝑃 ≤ (𝑃 ∨ (𝑋 ∧ 𝑊)))
3828, 31, 36, 37syl3anc 1398 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑃 ≤ (𝑃 ∨ (𝑋 ∧ 𝑊)))
39 simpr 490 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)
4038, 39breqtrd 5130 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑃 ≤ 𝑋)
4126, 40impbida 813 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ≤ 𝑋 ↔ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋))
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 2144   class class class wbr 5102  ‘cfv 6541  (class class class)co 7422  Basecbs 17394  lecple 17442  joincjn 18492  meetcmee 18493  1.cp1 18603  Latclat 18612  OLcol 40338  Atomscatm 40427  HLchlt 40514  LHypclh 41148
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753
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 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7379  df-ov 7425  df-oprab 7426  df-mpo 7427  df-1st 8003  df-2nd 8004  df-proset 18475  df-poset 18494  df-plt 18509  df-lub 18525  df-glb 18526  df-join 18527  df-meet 18528  df-p0 18604  df-p1 18605  df-lat 18613  df-clat 18680  df-oposet 40340  df-ol 40342  df-oml 40343  df-covers 40430  df-ats 40431  df-atl 40462  df-cvlat 40486  df-hlat 40515  df-psubsp 40667  df-pmap 40668  df-padd 40960  df-lhyp 41152
This theorem is used by:  dihvalcq2  42411
  Copyright terms: Public domain W3C validator