Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onfrALT Unicode version

Theorem onfrALT 28370
Description: The epsilon relation is foundational on the class of ordinal numbers. onfrALT 28370 is an alternate proof of onfr 4433. onfrALTVD 28740 is the Virtual Deduction proof from which onfrALT 28370 is derived. The Virtual Deduction proof mirrors the working proof of onfr 4433 which is the main part of the proof of Theorem 7.12 of the first edition of TakeutiZaring. The proof of the corresponding Proposition 7.12 of [TakeutiZaring] p. 38 (second edition) does not contain the working proof equivalent of onfrALTVD 28740. This theorem does not rely on the Axiom of Regularity. (Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
onfrALT  |-  _E  Fr  On

Proof of Theorem onfrALT
Dummy variables  x  a  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfepfr 4380 . 2  |-  (  _E  Fr  On  <->  A. a
( ( a  C_  On  /\  a  =/=  (/) )  ->  E. y  e.  a 
( a  i^i  y
)  =  (/) ) )
2 simpr 447 . . 3  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  a  =/=  (/) )
3 n0 3466 . . . 4  |-  ( a  =/=  (/)  <->  E. x  x  e.  a )
4 onfrALTlem1 28369 . . . . . . 7  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  (
( x  e.  a  /\  ( a  i^i  x )  =  (/) )  ->  E. y  e.  a  ( a  i^i  y
)  =  (/) ) )
54exp3a 425 . . . . . 6  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  (
x  e.  a  -> 
( ( a  i^i  x )  =  (/)  ->  E. y  e.  a  ( a  i^i  y
)  =  (/) ) ) )
6 onfrALTlem2 28367 . . . . . . 7  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  (
( x  e.  a  /\  -.  ( a  i^i  x )  =  (/) )  ->  E. y  e.  a  ( a  i^i  y )  =  (/) ) )
76exp3a 425 . . . . . 6  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  (
x  e.  a  -> 
( -.  ( a  i^i  x )  =  (/)  ->  E. y  e.  a  ( a  i^i  y
)  =  (/) ) ) )
8 pm2.61 163 . . . . . 6  |-  ( ( ( a  i^i  x
)  =  (/)  ->  E. y  e.  a  ( a  i^i  y )  =  (/) )  ->  ( ( -.  ( a  i^i  x
)  =  (/)  ->  E. y  e.  a  ( a  i^i  y )  =  (/) )  ->  E. y  e.  a  ( a  i^i  y
)  =  (/) ) )
95, 7, 8ee22 1352 . . . . 5  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  (
x  e.  a  ->  E. y  e.  a 
( a  i^i  y
)  =  (/) ) )
109exlimdv 1666 . . . 4  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  ( E. x  x  e.  a  ->  E. y  e.  a  ( a  i^i  y
)  =  (/) ) )
113, 10syl5bi 208 . . 3  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  (
a  =/=  (/)  ->  E. y  e.  a  ( a  i^i  y )  =  (/) ) )
122, 11mpd 14 . 2  |-  ( ( a  C_  On  /\  a  =/=  (/) )  ->  E. y  e.  a  ( a  i^i  y )  =  (/) )
131, 12mpgbir 1539 1  |-  _E  Fr  On
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358   E.wex 1530    = wceq 1625    =/= wne 2448   E.wrex 2546    i^i cin 3153    C_ wss 3154   (/)c0 3457    _E cep 4305    Fr wfr 4351   Oncon0 4394
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-14 1690  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-sep 4143  ax-nul 4151  ax-pr 4216
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-mo 2150  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-ral 2550  df-rex 2551  df-rab 2554  df-v 2792  df-sbc 2994  df-csb 3084  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-nul 3458  df-if 3568  df-sn 3648  df-pr 3649  df-op 3651  df-uni 3830  df-br 4026  df-opab 4080  df-tr 4116  df-eprel 4307  df-po 4316  df-so 4317  df-fr 4354  df-we 4356  df-ord 4397  df-on 4398
  Copyright terms: Public domain W3C validator