Theorem hlexch4N 38258

Description: A Hilbert lattice has the exchange property. Part of Definition 7.8 of [MaedaMaeda] p. 32. (Contributed by NM, 15-Nov-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
hlexch3.b	⊢ 𝐵 = (Base‘𝐾)
hlexch3.l	⊢ ≤ = (le‘𝐾)
hlexch3.j	⊢ ∨ = (join‘𝐾)
hlexch3.m	⊢ ∧ = (meet‘𝐾)
hlexch3.z	⊢ 0 = (0.‘𝐾)
hlexch3.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
hlexch4N	⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))

Proof of Theorem hlexch4N

Step	Hyp	Ref	Expression
1		hlcvl 38224	. 2 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat)
2		hlexch3.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
3		hlexch3.l	. . 3 ⊢ ≤ = (le‘𝐾)
4		hlexch3.j	. . 3 ⊢ ∨ = (join‘𝐾)
5		hlexch3.m	. . 3 ⊢ ∧ = (meet‘𝐾)
6		hlexch3.z	. . 3 ⊢ 0 = (0.‘𝐾)
7		hlexch3.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
8	2, 3, 4, 5, 6, 7	cvlexch4N 38198	. 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))
9	1, 8	syl3an1 1163	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   class class class wbr 5148  ‘cfv 6543  (class class class)co 7408  Basecbs 17143  lecple 17203  joincjn 18263  meetcmee 18264  0.cp0 18375  Atomscatm 38128  CvLatclc 38130  HLchlt 38215

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7364  df-ov 7411  df-oprab 7412  df-proset 18247  df-poset 18265  df-plt 18282  df-lub 18298  df-glb 18299  df-join 18300  df-meet 18301  df-p0 18377  df-lat 18384  df-covers 38131  df-ats 38132  df-atl 38163  df-cvlat 38187  df-hlat 38216

This theorem is referenced by: (None)