Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  latasym Structured version   Visualization version   GIF version

Theorem latasym 17262
 Description: A lattice ordering is asymmetric. (eqss 3765 analog.) (Contributed by NM, 8-Oct-2011.)
Hypotheses
Ref Expression
latref.b 𝐵 = (Base‘𝐾)
latref.l = (le‘𝐾)
Assertion
Ref Expression
latasym ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌))

Proof of Theorem latasym
StepHypRef Expression
1 latref.b . . 3 𝐵 = (Base‘𝐾)
2 latref.l . . 3 = (le‘𝐾)
31, 2latasymb 17261 . 2 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌𝑌 𝑋) ↔ 𝑋 = 𝑌))
43biimpd 219 1 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌𝑌 𝑋) → 𝑋 = 𝑌))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 382   ∧ w3a 1070   = wceq 1630   ∈ wcel 2144   class class class wbr 4784  ‘cfv 6031  Basecbs 16063  lecple 16155  Latclat 17252 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-nul 4920 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-sbc 3586  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-br 4785  df-opab 4845  df-xp 5255  df-dm 5259  df-iota 5994  df-fv 6039  df-preset 17135  df-poset 17153  df-lat 17253 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator