MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  frirr Unicode version

Theorem frirr 4386
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.)
Assertion
Ref Expression
frirr  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  -.  B R B )

Proof of Theorem frirr
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 443 . . 3  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  R  Fr  A )
2 simpr 447 . . . 4  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  B  e.  A )
32snssd 3776 . . 3  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  { B }  C_  A )
4 snnzg 3756 . . . 4  |-  ( B  e.  A  ->  { B }  =/=  (/) )
54adantl 452 . . 3  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  { B }  =/=  (/) )
6 snex 4232 . . . 4  |-  { B }  e.  _V
76frc 4375 . . 3  |-  ( ( R  Fr  A  /\  { B }  C_  A  /\  { B }  =/=  (/) )  ->  E. y  e.  { B }  {
x  e.  { B }  |  x R
y }  =  (/) )
81, 3, 5, 7syl3anc 1182 . 2  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  E. y  e.  { B }  { x  e.  { B }  |  x R y }  =  (/) )
9 rabeq0 3489 . . . . . 6  |-  ( { x  e.  { B }  |  x R
y }  =  (/)  <->  A. x  e.  { B }  -.  x R y )
10 breq2 4043 . . . . . . . 8  |-  ( y  =  B  ->  (
x R y  <->  x R B ) )
1110notbid 285 . . . . . . 7  |-  ( y  =  B  ->  ( -.  x R y  <->  -.  x R B ) )
1211ralbidv 2576 . . . . . 6  |-  ( y  =  B  ->  ( A. x  e.  { B }  -.  x R y  <->  A. x  e.  { B }  -.  x R B ) )
139, 12syl5bb 248 . . . . 5  |-  ( y  =  B  ->  ( { x  e.  { B }  |  x R
y }  =  (/)  <->  A. x  e.  { B }  -.  x R B ) )
1413rexsng 3686 . . . 4  |-  ( B  e.  A  ->  ( E. y  e.  { B }  { x  e.  { B }  |  x R y }  =  (/)  <->  A. x  e.  { B }  -.  x R B ) )
15 breq1 4042 . . . . . 6  |-  ( x  =  B  ->  (
x R B  <->  B R B ) )
1615notbid 285 . . . . 5  |-  ( x  =  B  ->  ( -.  x R B  <->  -.  B R B ) )
1716ralsng 3685 . . . 4  |-  ( B  e.  A  ->  ( A. x  e.  { B }  -.  x R B  <->  -.  B R B ) )
1814, 17bitrd 244 . . 3  |-  ( B  e.  A  ->  ( E. y  e.  { B }  { x  e.  { B }  |  x R y }  =  (/)  <->  -.  B R B ) )
1918adantl 452 . 2  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  ( E. y  e. 
{ B }  {
x  e.  { B }  |  x R
y }  =  (/)  <->  -.  B R B ) )
208, 19mpbid 201 1  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  -.  B R B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696    =/= wne 2459   A.wral 2556   E.wrex 2557   {crab 2560    C_ wss 3165   (/)c0 3468   {csn 3653   class class class wbr 4039    Fr wfr 4365
This theorem is referenced by:  efrirr  4390  dfwe2  4589  efrunt  24074  predfrirr  24269  ifr0  27756  bnj1417  29387
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-br 4040  df-fr 4368
  Copyright terms: Public domain W3C validator