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

Theorem inf2 7324
Description: Variation of Axiom of Infinity. There exists a non-empty set that is a subset of its union (using zfinf 7340 as a hypothesis). Abbreviated version of the Axiom of Infinity in [FreydScedrov] p. 283. (Contributed by NM, 28-Oct-1996.)
Hypothesis
Ref Expression
inf1.1  |-  E. x
( y  e.  x  /\  A. y ( y  e.  x  ->  E. z
( y  e.  z  /\  z  e.  x
) ) )
Assertion
Ref Expression
inf2  |-  E. x
( x  =/=  (/)  /\  x  C_ 
U. x )
Distinct variable group:    x, y, z

Proof of Theorem inf2
StepHypRef Expression
1 inf1.1 . . 3  |-  E. x
( y  e.  x  /\  A. y ( y  e.  x  ->  E. z
( y  e.  z  /\  z  e.  x
) ) )
21inf1 7323 . 2  |-  E. x
( x  =/=  (/)  /\  A. y ( y  e.  x  ->  E. z
( y  e.  z  /\  z  e.  x
) ) )
3 dfss2 3169 . . . . 5  |-  ( x 
C_  U. x  <->  A. y
( y  e.  x  ->  y  e.  U. x
) )
4 eluni 3830 . . . . . . 7  |-  ( y  e.  U. x  <->  E. z
( y  e.  z  /\  z  e.  x
) )
54imbi2i 303 . . . . . 6  |-  ( ( y  e.  x  -> 
y  e.  U. x
)  <->  ( y  e.  x  ->  E. z
( y  e.  z  /\  z  e.  x
) ) )
65albii 1553 . . . . 5  |-  ( A. y ( y  e.  x  ->  y  e.  U. x )  <->  A. y
( y  e.  x  ->  E. z ( y  e.  z  /\  z  e.  x ) ) )
73, 6bitri 240 . . . 4  |-  ( x 
C_  U. x  <->  A. y
( y  e.  x  ->  E. z ( y  e.  z  /\  z  e.  x ) ) )
87anbi2i 675 . . 3  |-  ( ( x  =/=  (/)  /\  x  C_ 
U. x )  <->  ( x  =/=  (/)  /\  A. y
( y  e.  x  ->  E. z ( y  e.  z  /\  z  e.  x ) ) ) )
98exbii 1569 . 2  |-  ( E. x ( x  =/=  (/)  /\  x  C_  U. x
)  <->  E. x ( x  =/=  (/)  /\  A. y
( y  e.  x  ->  E. z ( y  e.  z  /\  z  e.  x ) ) ) )
102, 9mpbir 200 1  |-  E. x
( x  =/=  (/)  /\  x  C_ 
U. x )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358   A.wal 1527   E.wex 1528    e. wcel 1684    =/= wne 2446    C_ wss 3152   (/)c0 3455   U.cuni 3827
This theorem is referenced by:  axinf2  7341
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 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-v 2790  df-dif 3155  df-in 3159  df-ss 3166  df-nul 3456  df-uni 3828
  Copyright terms: Public domain W3C validator