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

Theorem ishlat1 34116
 Description: The predicate "is a Hilbert lattice," which is orthomodular (𝐾 ∈ OML), complete (𝐾 ∈ CLat), atomic and satisfying the exchange (or covering) property (𝐾 ∈ CvLat), satisfies the superposition principle, and has a minimum height of 4. (Contributed by NM, 5-Nov-2012.)
Hypotheses
Ref Expression
ishlat.b 𝐵 = (Base‘𝐾)
ishlat.l = (le‘𝐾)
ishlat.s < = (lt‘𝐾)
ishlat.j = (join‘𝐾)
ishlat.z 0 = (0.‘𝐾)
ishlat.u 1 = (1.‘𝐾)
ishlat.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
ishlat1 (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ∧ (∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧
Allowed substitution hints:   < (𝑥,𝑦,𝑧)   1 (𝑥,𝑦,𝑧)   (𝑥,𝑦,𝑧)   (𝑥,𝑦,𝑧)   0 (𝑥,𝑦,𝑧)

Proof of Theorem ishlat1
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6148 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
2 ishlat.a . . . . . 6 𝐴 = (Atoms‘𝐾)
31, 2syl6eqr 2673 . . . . 5 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
4 fveq2 6148 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
5 ishlat.l . . . . . . . . . . . 12 = (le‘𝐾)
64, 5syl6eqr 2673 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = )
76breqd 4624 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦) ↔ 𝑧 (𝑥(join‘𝑘)𝑦)))
8 fveq2 6148 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
9 ishlat.j . . . . . . . . . . . . 13 = (join‘𝐾)
108, 9syl6eqr 2673 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (join‘𝑘) = )
1110oveqd 6621 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑥(join‘𝑘)𝑦) = (𝑥 𝑦))
1211breq2d 4625 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑧 (𝑥(join‘𝑘)𝑦) ↔ 𝑧 (𝑥 𝑦)))
137, 12bitrd 268 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦) ↔ 𝑧 (𝑥 𝑦)))
14133anbi3d 1402 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦)) ↔ (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))))
153, 14rexeqbidv 3142 . . . . . . 7 (𝑘 = 𝐾 → (∃𝑧 ∈ (Atoms‘𝑘)(𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦)) ↔ ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))))
1615imbi2d 330 . . . . . 6 (𝑘 = 𝐾 → ((𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝑘)(𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦))) ↔ (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦)))))
173, 16raleqbidv 3141 . . . . 5 (𝑘 = 𝐾 → (∀𝑦 ∈ (Atoms‘𝑘)(𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝑘)(𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦))) ↔ ∀𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦)))))
183, 17raleqbidv 3141 . . . 4 (𝑘 = 𝐾 → (∀𝑥 ∈ (Atoms‘𝑘)∀𝑦 ∈ (Atoms‘𝑘)(𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝑘)(𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦))) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦)))))
19 fveq2 6148 . . . . . 6 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
20 ishlat.b . . . . . 6 𝐵 = (Base‘𝐾)
2119, 20syl6eqr 2673 . . . . 5 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
22 fveq2 6148 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (lt‘𝑘) = (lt‘𝐾))
23 ishlat.s . . . . . . . . . . . 12 < = (lt‘𝐾)
2422, 23syl6eqr 2673 . . . . . . . . . . 11 (𝑘 = 𝐾 → (lt‘𝑘) = < )
2524breqd 4624 . . . . . . . . . 10 (𝑘 = 𝐾 → ((0.‘𝑘)(lt‘𝑘)𝑥 ↔ (0.‘𝑘) < 𝑥))
26 fveq2 6148 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (0.‘𝑘) = (0.‘𝐾))
27 ishlat.z . . . . . . . . . . . 12 0 = (0.‘𝐾)
2826, 27syl6eqr 2673 . . . . . . . . . . 11 (𝑘 = 𝐾 → (0.‘𝑘) = 0 )
2928breq1d 4623 . . . . . . . . . 10 (𝑘 = 𝐾 → ((0.‘𝑘) < 𝑥0 < 𝑥))
3025, 29bitrd 268 . . . . . . . . 9 (𝑘 = 𝐾 → ((0.‘𝑘)(lt‘𝑘)𝑥0 < 𝑥))
3124breqd 4624 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑥(lt‘𝑘)𝑦𝑥 < 𝑦))
3230, 31anbi12d 746 . . . . . . . 8 (𝑘 = 𝐾 → (((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ↔ ( 0 < 𝑥𝑥 < 𝑦)))
3324breqd 4624 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑦(lt‘𝑘)𝑧𝑦 < 𝑧))
3424breqd 4624 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑧(lt‘𝑘)(1.‘𝑘) ↔ 𝑧 < (1.‘𝑘)))
35 fveq2 6148 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (1.‘𝑘) = (1.‘𝐾))
36 ishlat.u . . . . . . . . . . . 12 1 = (1.‘𝐾)
3735, 36syl6eqr 2673 . . . . . . . . . . 11 (𝑘 = 𝐾 → (1.‘𝑘) = 1 )
3837breq2d 4625 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑧 < (1.‘𝑘) ↔ 𝑧 < 1 ))
3934, 38bitrd 268 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑧(lt‘𝑘)(1.‘𝑘) ↔ 𝑧 < 1 ))
4033, 39anbi12d 746 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘)) ↔ (𝑦 < 𝑧𝑧 < 1 )))
4132, 40anbi12d 746 . . . . . . 7 (𝑘 = 𝐾 → ((((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ∧ (𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘))) ↔ (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 ))))
4221, 41rexeqbidv 3142 . . . . . 6 (𝑘 = 𝐾 → (∃𝑧 ∈ (Base‘𝑘)(((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ∧ (𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘))) ↔ ∃𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 ))))
4321, 42rexeqbidv 3142 . . . . 5 (𝑘 = 𝐾 → (∃𝑦 ∈ (Base‘𝑘)∃𝑧 ∈ (Base‘𝑘)(((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ∧ (𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘))) ↔ ∃𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 ))))
4421, 43rexeqbidv 3142 . . . 4 (𝑘 = 𝐾 → (∃𝑥 ∈ (Base‘𝑘)∃𝑦 ∈ (Base‘𝑘)∃𝑧 ∈ (Base‘𝑘)(((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ∧ (𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘))) ↔ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 ))))
4518, 44anbi12d 746 . . 3 (𝑘 = 𝐾 → ((∀𝑥 ∈ (Atoms‘𝑘)∀𝑦 ∈ (Atoms‘𝑘)(𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝑘)(𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦))) ∧ ∃𝑥 ∈ (Base‘𝑘)∃𝑦 ∈ (Base‘𝑘)∃𝑧 ∈ (Base‘𝑘)(((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ∧ (𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘)))) ↔ (∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
46 df-hlat 34115 . . 3 HL = {𝑘 ∈ ((OML ∩ CLat) ∩ CvLat) ∣ (∀𝑥 ∈ (Atoms‘𝑘)∀𝑦 ∈ (Atoms‘𝑘)(𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝑘)(𝑧𝑥𝑧𝑦𝑧(le‘𝑘)(𝑥(join‘𝑘)𝑦))) ∧ ∃𝑥 ∈ (Base‘𝑘)∃𝑦 ∈ (Base‘𝑘)∃𝑧 ∈ (Base‘𝑘)(((0.‘𝑘)(lt‘𝑘)𝑥𝑥(lt‘𝑘)𝑦) ∧ (𝑦(lt‘𝑘)𝑧𝑧(lt‘𝑘)(1.‘𝑘))))}
4745, 46elrab2 3348 . 2 (𝐾 ∈ HL ↔ (𝐾 ∈ ((OML ∩ CLat) ∩ CvLat) ∧ (∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
48 elin 3774 . . . . 5 (𝐾 ∈ (OML ∩ CLat) ↔ (𝐾 ∈ OML ∧ 𝐾 ∈ CLat))
4948anbi1i 730 . . . 4 ((𝐾 ∈ (OML ∩ CLat) ∧ 𝐾 ∈ CvLat) ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat) ∧ 𝐾 ∈ CvLat))
50 elin 3774 . . . 4 (𝐾 ∈ ((OML ∩ CLat) ∩ CvLat) ↔ (𝐾 ∈ (OML ∩ CLat) ∧ 𝐾 ∈ CvLat))
51 df-3an 1038 . . . 4 ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat) ∧ 𝐾 ∈ CvLat))
5249, 50, 513bitr4ri 293 . . 3 ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ↔ 𝐾 ∈ ((OML ∩ CLat) ∩ CvLat))
5352anbi1i 730 . 2 (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ∧ (∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))) ↔ (𝐾 ∈ ((OML ∩ CLat) ∩ CvLat) ∧ (∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
5447, 53bitr4i 267 1 (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ∧ (∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1480   ∈ wcel 1987   ≠ wne 2790  ∀wral 2907  ∃wrex 2908   ∩ cin 3554   class class class wbr 4613  ‘cfv 5847  (class class class)co 6604  Basecbs 15781  lecple 15869  ltcplt 16862  joincjn 16865  0.cp0 16958  1.cp1 16959  CLatccla 17028  OMLcoml 33939  Atomscatm 34027  CvLatclc 34029  HLchlt 34114 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-iota 5810  df-fv 5855  df-ov 6607  df-hlat 34115 This theorem is referenced by:  ishlat2  34117  ishlat3N  34118  hlomcmcv  34120
 Copyright terms: Public domain W3C validator