Metamath Proof Explorer


Theorem frirr

Description: A well-founded relation is irreflexive. Special case of Proposition 6.23 of TakeutiZaring p. 30. (Contributed by NM, 2-Jan-1994) (Revised by Mario Carneiro, 22-Jun-2015)

Ref Expression
Assertion frirr RFrABA¬BRB

Proof

Step Hyp Ref Expression
1 simpl RFrABARFrA
2 snssi BABA
3 2 adantl RFrABABA
4 snnzg BAB
5 4 adantl RFrABAB
6 snex BV
7 6 frc RFrABAByBxB|xRy=
8 1 3 5 7 syl3anc RFrABAyBxB|xRy=
9 breq1 x=zxRyzRy
10 9 rabeq0w xB|xRy=zB¬zRy
11 breq2 y=BzRyzRB
12 11 notbid y=B¬zRy¬zRB
13 12 ralbidv y=BzB¬zRyzB¬zRB
14 10 13 bitrid y=BxB|xRy=zB¬zRB
15 14 rexsng BAyBxB|xRy=zB¬zRB
16 breq1 z=BzRBBRB
17 16 notbid z=B¬zRB¬BRB
18 17 ralsng BAzB¬zRB¬BRB
19 15 18 bitrd BAyBxB|xRy=¬BRB
20 19 adantl RFrABAyBxB|xRy=¬BRB
21 8 20 mpbid RFrABA¬BRB