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

Theorem onfrALT 27597
Description: The epsilon relation is foundational on the class of ordinal numbers. onfrALT 27597 is an alternate proof of onfr 4430. onfrALTVD 27947 is the Virtual Deduction proof from which onfrALT 27597 is derived. The Virtual Deduction proof mirrors the working proof of onfr 4430 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 27947. 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 4377 . 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 3465 . . . 4  |-  ( a  =/=  (/)  <->  E. x  x  e.  a )
4 onfrALTlem1 27596 . . . . . . 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 27594 . . . . . . 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 1665 . . . 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 1537 1  |-  _E  Fr  On
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358   E.wex 1528    = wceq 1623    =/= wne 2447   E.wrex 2545    i^i cin 3152    C_ wss 3153   (/)c0 3456    _E cep 4302    Fr wfr 4348   Oncon0 4391
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pr 4213
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-rab 2553  df-v 2791  df-sbc 2993  df-csb 3083  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-op 3650  df-uni 3829  df-br 4025  df-opab 4079  df-tr 4115  df-eprel 4304  df-po 4313  df-so 4314  df-fr 4351  df-we 4353  df-ord 4394  df-on 4395
  Copyright terms: Public domain W3C validator