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

Theorem frirr 4551
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 444 . . 3  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  R  Fr  A )
2 simpr 448 . . . 4  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  B  e.  A )
32snssd 3935 . . 3  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  { B }  C_  A )
4 snnzg 3913 . . . 4  |-  ( B  e.  A  ->  { B }  =/=  (/) )
54adantl 453 . . 3  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  { B }  =/=  (/) )
6 snex 4397 . . . 4  |-  { B }  e.  _V
76frc 4540 . . 3  |-  ( ( R  Fr  A  /\  { B }  C_  A  /\  { B }  =/=  (/) )  ->  E. y  e.  { B }  {
x  e.  { B }  |  x R
y }  =  (/) )
81, 3, 5, 7syl3anc 1184 . 2  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  E. y  e.  { B }  { x  e.  { B }  |  x R y }  =  (/) )
9 rabeq0 3641 . . . . . 6  |-  ( { x  e.  { B }  |  x R
y }  =  (/)  <->  A. x  e.  { B }  -.  x R y )
10 breq2 4208 . . . . . . . 8  |-  ( y  =  B  ->  (
x R y  <->  x R B ) )
1110notbid 286 . . . . . . 7  |-  ( y  =  B  ->  ( -.  x R y  <->  -.  x R B ) )
1211ralbidv 2717 . . . . . 6  |-  ( y  =  B  ->  ( A. x  e.  { B }  -.  x R y  <->  A. x  e.  { B }  -.  x R B ) )
139, 12syl5bb 249 . . . . 5  |-  ( y  =  B  ->  ( { x  e.  { B }  |  x R
y }  =  (/)  <->  A. x  e.  { B }  -.  x R B ) )
1413rexsng 3839 . . . 4  |-  ( B  e.  A  ->  ( E. y  e.  { B }  { x  e.  { B }  |  x R y }  =  (/)  <->  A. x  e.  { B }  -.  x R B ) )
15 breq1 4207 . . . . . 6  |-  ( x  =  B  ->  (
x R B  <->  B R B ) )
1615notbid 286 . . . . 5  |-  ( x  =  B  ->  ( -.  x R B  <->  -.  B R B ) )
1716ralsng 3838 . . . 4  |-  ( B  e.  A  ->  ( A. x  e.  { B }  -.  x R B  <->  -.  B R B ) )
1814, 17bitrd 245 . . 3  |-  ( B  e.  A  ->  ( E. y  e.  { B }  { x  e.  { B }  |  x R y }  =  (/)  <->  -.  B R B ) )
1918adantl 453 . 2  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  ( E. y  e. 
{ B }  {
x  e.  { B }  |  x R
y }  =  (/)  <->  -.  B R B ) )
208, 19mpbid 202 1  |-  ( ( R  Fr  A  /\  B  e.  A )  ->  -.  B R B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    = wceq 1652    e. wcel 1725    =/= wne 2598   A.wral 2697   E.wrex 2698   {crab 2701    C_ wss 3312   (/)c0 3620   {csn 3806   class class class wbr 4204    Fr wfr 4530
This theorem is referenced by:  efrirr  4555  dfwe2  4754  efrunt  25154  predfrirr  25465  ifr0  27620  bnj1417  29347
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-sbc 3154  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-fr 4533
  Copyright terms: Public domain W3C validator