Theorem latasym 17055

Description: A lattice ordering is asymmetric. (eqss 3618 analog.) (Contributed by NM, 8-Oct-2011.)

Hypotheses

Ref	Expression
latref.b	|- B = ( Base ` K )
latref.l	|- .<_ = ( le ` K )

Assertion

Ref	Expression
latasym	|- ( ( K e. Lat /\ X e. B /\ Y e. B ) -> ( ( X .<_ Y /\ Y .<_ X ) -> X = Y ) )

Proof of Theorem latasym

Step	Hyp	Ref	Expression
1		latref.b	. . 3 |- B = ( Base ` K )
2		latref.l	. . 3 |- .<_ = ( le ` K )
3	1, 2	latasymb 17054	. 2 |- ( ( K e. Lat /\ X e. B /\ Y e. B ) -> ( ( X .<_ Y /\ Y .<_ X ) <-> X = Y ) )
4	3	biimpd 219	1 |- ( ( K e. Lat /\ X e. B /\ Y e. B ) -> ( ( X .<_ Y /\ Y .<_ X ) -> X = Y ) )

Syntax hints:   -> wi 4   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   class class class wbr 4653   ` cfv 5888   Basecbs 15857   lecple 15948   Latclat 17045

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-xp 5120  df-dm 5124  df-iota 5851  df-fv 5896  df-preset 16928  df-poset 16946  df-lat 17046

This theorem is referenced by: (None)