HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem efrn2lp 2181
Description: A set founded by epsilon contains no 2-cycle loops.
Assertion
Ref Expression
efrn2lp |- ((E Fr A /\ (x e. A /\ y e. A)) -> -. (x e. y /\ y e. x))

Proof of Theorem efrn2lp
StepHypRef Expression
1 fr2nr 2177 . 2 |- ((E Fr A /\ (x e. A /\ y e. A)) -> -. (xEy /\ yEx))
2 epel 2124 . . . 4 |- (xEy <-> x e. y)
3 epel 2124 . . . 4 |- (yEx <-> y e. x)
42, 3anbi12i 369 . . 3 |- ((xEy /\ yEx) <-> (x e. y /\ y e. x))
54negbii 162 . 2 |- (-. (xEy /\ yEx) <-> -. (x e. y /\ y e. x))
61, 5sylib 173 1 |- ((E Fr A /\ (x e. A /\ y e. A)) -> -. (x e. y /\ y e. x))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   e. wel 803   e. wcel 1092   class class class wbr 2054  Ecep 2056   Fr wfr 2061
This theorem is referenced by:  en2lp 3453
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-eprel 2122  df-fr 2169
metamath.org