Theorem hlexch4N 40021

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 39988	. 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 39962	. 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))
9	1, 8	syl3an1 1177	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) ↔ (𝑋 ∨ 𝑃) = (𝑋 ∨ 𝑄)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144   class class class wbr 5102  ‘cfv 6523  (class class class)co 7398  Basecbs 17247  lecple 17295  joincjn 18345  meetcmee 18346  0.cp0 18455  Atomscatm 39892  CvLatclc 39894  HLchlt 39979

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-oprab 7402  df-proset 18328  df-poset 18347  df-plt 18362  df-lub 18378  df-glb 18379  df-join 18380  df-meet 18381  df-p0 18457  df-lat 18466  df-covers 39895  df-ats 39896  df-atl 39927  df-cvlat 39951  df-hlat 39980

This theorem is referenced by: (None)