Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cvlexch4N Structured version   Visualization version   GIF version
Theorem cvlexch4N 38716
Description: An atomic covering lattice has the exchange property. Part of Definition 7.8 of [MaedaMaeda] p. 32. (Contributed by NM, 5-Nov-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
cvlexch3.b 𝐡 = (Baseβ€˜πΎ)
cvlexch3.l ≀ = (leβ€˜πΎ)
cvlexch3.j ∨ = (joinβ€˜πΎ)
cvlexch3.m ∧ = (meetβ€˜πΎ)
cvlexch3.z 0 = (0.β€˜πΎ)
cvlexch3.a 𝐴 = (Atomsβ€˜πΎ)
Assertion
Ref Expression
cvlexch4N ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡) ∧ (𝑃 ∧ 𝑋) = 0 ) β†’ (𝑃 ≀ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))
Proof of Theorem cvlexch4N
StepHypRef Expression
1 cvlatl 38708 . . . . 5 (𝐾 ∈ CvLat β†’ 𝐾 ∈ AtLat)
21adantr 480 . . . 4 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡)) β†’ 𝐾 ∈ AtLat)
3 simpr1 1191 . . . 4 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡)) β†’ 𝑃 ∈ 𝐴)
4 simpr3 1193 . . . 4 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡)) β†’ 𝑋 ∈ 𝐡)
5 cvlexch3.b . . . . 5 𝐡 = (Baseβ€˜πΎ)
6 cvlexch3.l . . . . 5 ≀ = (leβ€˜πΎ)
7 cvlexch3.m . . . . 5 ∧ = (meetβ€˜πΎ)
8 cvlexch3.z . . . . 5 0 = (0.β€˜πΎ)
9 cvlexch3.a . . . . 5 𝐴 = (Atomsβ€˜πΎ)
105, 6, 7, 8, 9atnle 38700 . . . 4 ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡) β†’ (Β¬ 𝑃 ≀ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 ))
112, 3, 4, 10syl3anc 1368 . . 3 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡)) β†’ (Β¬ 𝑃 ≀ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 ))
12 cvlexch3.j . . . . 5 ∨ = (joinβ€˜πΎ)
135, 6, 12, 9cvlexchb1 38713 . . . 4 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡) ∧ Β¬ 𝑃 ≀ 𝑋) β†’ (𝑃 ≀ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))
14133expia 1118 . . 3 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡)) β†’ (Β¬ 𝑃 ≀ 𝑋 β†’ (𝑃 ≀ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄))))
1511, 14sylbird 260 . 2 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡)) β†’ ((𝑃 ∧ 𝑋) = 0 β†’ (𝑃 ≀ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄))))
16153impia 1114 1 ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐡) ∧ (𝑃 ∧ 𝑋) = 0 ) β†’ (𝑃 ≀ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))
Colors of variables: wff setvar class
Syntax hints:  Β¬ wn 3   β†’ wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098   class class class wbr 5141  β€˜cfv 6537  (class class class)co 7405  Basecbs 17153  lecple 17213  joincjn 18276  meetcmee 18277  0.cp0 18388  Atomscatm 38646  AtLatcal 38647  CvLatclc 38648
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 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rmo 3370  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7361  df-ov 7408  df-oprab 7409  df-proset 18260  df-poset 18278  df-plt 18295  df-lub 18311  df-glb 18312  df-join 18313  df-meet 18314  df-p0 18390  df-lat 18397  df-covers 38649  df-ats 38650  df-atl 38681  df-cvlat 38705
This theorem is referenced by:  hlexch4N  38776
  Copyright terms: Public domain W3C validator