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

Theorem isoml 36434
 Description: The predicate "is an orthomodular lattice." (Contributed by NM, 18-Sep-2011.)
Hypotheses
Ref Expression
isoml.b 𝐵 = (Base‘𝐾)
isoml.l = (le‘𝐾)
isoml.j = (join‘𝐾)
isoml.m = (meet‘𝐾)
isoml.o = (oc‘𝐾)
Assertion
Ref Expression
isoml (𝐾 ∈ OML ↔ (𝐾 ∈ OL ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦𝑦 = (𝑥 (𝑦 ( 𝑥))))))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦
Allowed substitution hints:   (𝑥,𝑦)   (𝑥,𝑦)   (𝑥,𝑦)   (𝑥,𝑦)

Proof of Theorem isoml
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6651 . . . 4 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
2 isoml.b . . . 4 𝐵 = (Base‘𝐾)
31, 2syl6eqr 2877 . . 3 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
4 fveq2 6651 . . . . . . 7 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
5 isoml.l . . . . . . 7 = (le‘𝐾)
64, 5syl6eqr 2877 . . . . . 6 (𝑘 = 𝐾 → (le‘𝑘) = )
76breqd 5058 . . . . 5 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑦𝑥 𝑦))
8 fveq2 6651 . . . . . . . 8 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
9 isoml.j . . . . . . . 8 = (join‘𝐾)
108, 9syl6eqr 2877 . . . . . . 7 (𝑘 = 𝐾 → (join‘𝑘) = )
11 eqidd 2825 . . . . . . 7 (𝑘 = 𝐾𝑥 = 𝑥)
12 fveq2 6651 . . . . . . . . 9 (𝑘 = 𝐾 → (meet‘𝑘) = (meet‘𝐾))
13 isoml.m . . . . . . . . 9 = (meet‘𝐾)
1412, 13syl6eqr 2877 . . . . . . . 8 (𝑘 = 𝐾 → (meet‘𝑘) = )
15 eqidd 2825 . . . . . . . 8 (𝑘 = 𝐾𝑦 = 𝑦)
16 fveq2 6651 . . . . . . . . . 10 (𝑘 = 𝐾 → (oc‘𝑘) = (oc‘𝐾))
17 isoml.o . . . . . . . . . 10 = (oc‘𝐾)
1816, 17syl6eqr 2877 . . . . . . . . 9 (𝑘 = 𝐾 → (oc‘𝑘) = )
1918fveq1d 6653 . . . . . . . 8 (𝑘 = 𝐾 → ((oc‘𝑘)‘𝑥) = ( 𝑥))
2014, 15, 19oveq123d 7159 . . . . . . 7 (𝑘 = 𝐾 → (𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥)) = (𝑦 ( 𝑥)))
2110, 11, 20oveq123d 7159 . . . . . 6 (𝑘 = 𝐾 → (𝑥(join‘𝑘)(𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥))) = (𝑥 (𝑦 ( 𝑥))))
2221eqeq2d 2835 . . . . 5 (𝑘 = 𝐾 → (𝑦 = (𝑥(join‘𝑘)(𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥))) ↔ 𝑦 = (𝑥 (𝑦 ( 𝑥)))))
237, 22imbi12d 348 . . . 4 (𝑘 = 𝐾 → ((𝑥(le‘𝑘)𝑦𝑦 = (𝑥(join‘𝑘)(𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥)))) ↔ (𝑥 𝑦𝑦 = (𝑥 (𝑦 ( 𝑥))))))
243, 23raleqbidv 3392 . . 3 (𝑘 = 𝐾 → (∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦𝑦 = (𝑥(join‘𝑘)(𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥)))) ↔ ∀𝑦𝐵 (𝑥 𝑦𝑦 = (𝑥 (𝑦 ( 𝑥))))))
253, 24raleqbidv 3392 . 2 (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦𝑦 = (𝑥(join‘𝑘)(𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥)))) ↔ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦𝑦 = (𝑥 (𝑦 ( 𝑥))))))
26 df-oml 36375 . 2 OML = {𝑘 ∈ OL ∣ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦𝑦 = (𝑥(join‘𝑘)(𝑦(meet‘𝑘)((oc‘𝑘)‘𝑥))))}
2725, 26elrab2 3668 1 (𝐾 ∈ OML ↔ (𝐾 ∈ OL ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦𝑦 = (𝑥 (𝑦 ( 𝑥))))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ∀wral 3132   class class class wbr 5047  ‘cfv 6336  (class class class)co 7138  Basecbs 16472  lecple 16561  occoc 16562  joincjn 17543  meetcmee 17544  OLcol 36370  OMLcoml 36371 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3137  df-rab 3141  df-v 3481  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-nul 4275  df-if 4449  df-sn 4549  df-pr 4551  df-op 4555  df-uni 4820  df-br 5048  df-iota 6295  df-fv 6344  df-ov 7141  df-oml 36375 This theorem is referenced by:  isomliN  36435  omlol  36436  omllaw  36439
 Copyright terms: Public domain W3C validator