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

Theorem dffr3 5199
Description: Alternate definition of well-founded relation. Definition 6.21 of [TakeutiZaring] p. 30. (Contributed by NM, 23-Apr-2004.) (Revised by Mario Carneiro, 23-Jun-2015.)
Assertion
Ref Expression
dffr3  |-  ( R  Fr  A  <->  A. x
( ( x  C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  ( x  i^i  ( `' R " { y } ) )  =  (/) ) )
Distinct variable groups:    x, y, A    x, R, y

Proof of Theorem dffr3
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 dffr2 4511 . 2  |-  ( R  Fr  A  <->  A. x
( ( x  C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  { z  e.  x  |  z R y }  =  (/) ) )
2 vex 2923 . . . . . . . . 9  |-  y  e. 
_V
3 iniseg 5198 . . . . . . . . 9  |-  ( y  e.  _V  ->  ( `' R " { y } )  =  {
z  |  z R y } )
42, 3ax-mp 8 . . . . . . . 8  |-  ( `' R " { y } )  =  {
z  |  z R y }
54ineq2i 3503 . . . . . . 7  |-  ( x  i^i  ( `' R " { y } ) )  =  ( x  i^i  { z  |  z R y } )
6 dfrab3 3581 . . . . . . 7  |-  { z  e.  x  |  z R y }  =  ( x  i^i  { z  |  z R y } )
75, 6eqtr4i 2431 . . . . . 6  |-  ( x  i^i  ( `' R " { y } ) )  =  { z  e.  x  |  z R y }
87eqeq1i 2415 . . . . 5  |-  ( ( x  i^i  ( `' R " { y } ) )  =  (/) 
<->  { z  e.  x  |  z R y }  =  (/) )
98rexbii 2695 . . . 4  |-  ( E. y  e.  x  ( x  i^i  ( `' R " { y } ) )  =  (/) 
<->  E. y  e.  x  { z  e.  x  |  z R y }  =  (/) )
109imbi2i 304 . . 3  |-  ( ( ( x  C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  ( x  i^i  ( `' R " { y } ) )  =  (/) )  <->  ( ( x 
C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  { z  e.  x  |  z R y }  =  (/) ) )
1110albii 1572 . 2  |-  ( A. x ( ( x 
C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  ( x  i^i  ( `' R " { y } ) )  =  (/) )  <->  A. x
( ( x  C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  { z  e.  x  |  z R y }  =  (/) ) )
121, 11bitr4i 244 1  |-  ( R  Fr  A  <->  A. x
( ( x  C_  A  /\  x  =/=  (/) )  ->  E. y  e.  x  ( x  i^i  ( `' R " { y } ) )  =  (/) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359   A.wal 1546    = wceq 1649    e. wcel 1721   {cab 2394    =/= wne 2571   E.wrex 2671   {crab 2674   _Vcvv 2920    i^i cin 3283    C_ wss 3284   (/)c0 3592   {csn 3778   class class class wbr 4176    Fr wfr 4502   `'ccnv 4840   "cima 4844
This theorem is referenced by:  isofrlem  6023  dffr4  25400
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2389  ax-sep 4294  ax-nul 4302  ax-pr 4367
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2262  df-mo 2263  df-clab 2395  df-cleq 2401  df-clel 2404  df-nfc 2533  df-ne 2573  df-ral 2675  df-rex 2676  df-rab 2679  df-v 2922  df-sbc 3126  df-dif 3287  df-un 3289  df-in 3291  df-ss 3298  df-nul 3593  df-if 3704  df-sn 3784  df-pr 3785  df-op 3787  df-br 4177  df-opab 4231  df-fr 4505  df-xp 4847  df-cnv 4849  df-dm 4851  df-rn 4852  df-res 4853  df-ima 4854
  Copyright terms: Public domain W3C validator