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

Theorem dcomex 8089
Description: The Axiom of Dependent Choice implies Infinity, the way we have stated it. Thus, we have Inf+AC implies DC and DC implies Inf, but AC does not imply Inf. (Contributed by Mario Carneiro, 25-Jan-2013.)
Assertion
Ref Expression
dcomex  |-  om  e.  _V

Proof of Theorem dcomex
Dummy variables  t 
s  x  f  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snex 4232 . . 3  |-  { <. 1o ,  1o >. }  e.  _V
2 1on 6502 . . . . . . . . . 10  |-  1o  e.  On
32elexi 2810 . . . . . . . . 9  |-  1o  e.  _V
43, 3fvsn 5729 . . . . . . . 8  |-  ( {
<. 1o ,  1o >. } `
 1o )  =  1o
53, 3funsn 5316 . . . . . . . . 9  |-  Fun  { <. 1o ,  1o >. }
63snid 3680 . . . . . . . . . 10  |-  1o  e.  { 1o }
73dmsnop 5163 . . . . . . . . . 10  |-  dom  { <. 1o ,  1o >. }  =  { 1o }
86, 7eleqtrri 2369 . . . . . . . . 9  |-  1o  e.  dom  { <. 1o ,  1o >. }
9 funbrfvb 5581 . . . . . . . . 9  |-  ( ( Fun  { <. 1o ,  1o >. }  /\  1o  e.  dom  { <. 1o ,  1o >. } )  -> 
( ( { <. 1o ,  1o >. } `  1o )  =  1o  <->  1o { <. 1o ,  1o >. } 1o ) )
105, 8, 9mp2an 653 . . . . . . . 8  |-  ( ( { <. 1o ,  1o >. } `  1o )  =  1o  <->  1o { <. 1o ,  1o >. } 1o )
114, 10mpbi 199 . . . . . . 7  |-  1o { <. 1o ,  1o >. } 1o
12 breq12 4044 . . . . . . . 8  |-  ( ( s  =  1o  /\  t  =  1o )  ->  ( s { <. 1o ,  1o >. } t  <-> 
1o { <. 1o ,  1o >. } 1o ) )
133, 3, 12spc2ev 2889 . . . . . . 7  |-  ( 1o { <. 1o ,  1o >. } 1o  ->  E. s E. t  s { <. 1o ,  1o >. } t )
1411, 13ax-mp 8 . . . . . 6  |-  E. s E. t  s { <. 1o ,  1o >. } t
15 breq 4041 . . . . . . 7  |-  ( x  =  { <. 1o ,  1o >. }  ->  (
s x t  <->  s { <. 1o ,  1o >. } t ) )
16152exbidv 1618 . . . . . 6  |-  ( x  =  { <. 1o ,  1o >. }  ->  ( E. s E. t  s x t  <->  E. s E. t  s { <. 1o ,  1o >. } t ) )
1714, 16mpbiri 224 . . . . 5  |-  ( x  =  { <. 1o ,  1o >. }  ->  E. s E. t  s x
t )
18 ssid 3210 . . . . . . 7  |-  { 1o }  C_  { 1o }
193rnsnop 5169 . . . . . . 7  |-  ran  { <. 1o ,  1o >. }  =  { 1o }
2018, 19, 73sstr4i 3230 . . . . . 6  |-  ran  { <. 1o ,  1o >. } 
C_  dom  { <. 1o ,  1o >. }
21 rneq 4920 . . . . . . 7  |-  ( x  =  { <. 1o ,  1o >. }  ->  ran  x  =  ran  { <. 1o ,  1o >. } )
22 dmeq 4895 . . . . . . 7  |-  ( x  =  { <. 1o ,  1o >. }  ->  dom  x  =  dom  { <. 1o ,  1o >. } )
2321, 22sseq12d 3220 . . . . . 6  |-  ( x  =  { <. 1o ,  1o >. }  ->  ( ran  x  C_  dom  x  <->  ran  { <. 1o ,  1o >. }  C_  dom  { <. 1o ,  1o >. } ) )
2420, 23mpbiri 224 . . . . 5  |-  ( x  =  { <. 1o ,  1o >. }  ->  ran  x  C_  dom  x )
25 pm5.5 326 . . . . 5  |-  ( ( E. s E. t 
s x t  /\  ran  x  C_  dom  x )  ->  ( ( ( E. s E. t 
s x t  /\  ran  x  C_  dom  x )  ->  E. f A. n  e.  om  ( f `  n ) x ( f `  suc  n
) )  <->  E. f A. n  e.  om  ( f `  n
) x ( f `
 suc  n )
) )
2617, 24, 25syl2anc 642 . . . 4  |-  ( x  =  { <. 1o ,  1o >. }  ->  (
( ( E. s E. t  s x
t  /\  ran  x  C_  dom  x )  ->  E. f A. n  e.  om  ( f `  n
) x ( f `
 suc  n )
)  <->  E. f A. n  e.  om  ( f `  n ) x ( f `  suc  n
) ) )
27 breq 4041 . . . . . 6  |-  ( x  =  { <. 1o ,  1o >. }  ->  (
( f `  n
) x ( f `
 suc  n )  <->  ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n ) ) )
2827ralbidv 2576 . . . . 5  |-  ( x  =  { <. 1o ,  1o >. }  ->  ( A. n  e.  om  ( f `  n
) x ( f `
 suc  n )  <->  A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n ) ) )
2928exbidv 1616 . . . 4  |-  ( x  =  { <. 1o ,  1o >. }  ->  ( E. f A. n  e. 
om  ( f `  n ) x ( f `  suc  n
)  <->  E. f A. n  e.  om  ( f `  n ) { <. 1o ,  1o >. }  (
f `  suc  n ) ) )
3026, 29bitrd 244 . . 3  |-  ( x  =  { <. 1o ,  1o >. }  ->  (
( ( E. s E. t  s x
t  /\  ran  x  C_  dom  x )  ->  E. f A. n  e.  om  ( f `  n
) x ( f `
 suc  n )
)  <->  E. f A. n  e.  om  ( f `  n ) { <. 1o ,  1o >. }  (
f `  suc  n ) ) )
31 ax-dc 8088 . . 3  |-  ( ( E. s E. t 
s x t  /\  ran  x  C_  dom  x )  ->  E. f A. n  e.  om  ( f `  n ) x ( f `  suc  n
) )
321, 30, 31vtocl 2851 . 2  |-  E. f A. n  e.  om  ( f `  n
) { <. 1o ,  1o >. }  ( f `
 suc  n )
33 1n0 6510 . . . . . . . 8  |-  1o  =/=  (/)
34 df-br 4040 . . . . . . . . 9  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  <->  <. ( f `
 n ) ,  ( f `  suc  n ) >.  e.  { <. 1o ,  1o >. } )
35 elsni 3677 . . . . . . . . . 10  |-  ( <.
( f `  n
) ,  ( f `
 suc  n ) >.  e.  { <. 1o ,  1o >. }  ->  <. (
f `  n ) ,  ( f `  suc  n ) >.  =  <. 1o ,  1o >. )
36 fvex 5555 . . . . . . . . . . 11  |-  ( f `
 n )  e. 
_V
37 fvex 5555 . . . . . . . . . . 11  |-  ( f `
 suc  n )  e.  _V
3836, 37opth1 4260 . . . . . . . . . 10  |-  ( <.
( f `  n
) ,  ( f `
 suc  n ) >.  =  <. 1o ,  1o >.  ->  ( f `  n )  =  1o )
3935, 38syl 15 . . . . . . . . 9  |-  ( <.
( f `  n
) ,  ( f `
 suc  n ) >.  e.  { <. 1o ,  1o >. }  ->  (
f `  n )  =  1o )
4034, 39sylbi 187 . . . . . . . 8  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  (
f `  n )  =  1o )
41 tz6.12i 5564 . . . . . . . 8  |-  ( 1o  =/=  (/)  ->  ( (
f `  n )  =  1o  ->  n f 1o ) )
4233, 40, 41mpsyl 59 . . . . . . 7  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  n
f 1o )
43 vex 2804 . . . . . . . 8  |-  n  e. 
_V
4443, 3breldm 4899 . . . . . . 7  |-  ( n f 1o  ->  n  e.  dom  f )
4542, 44syl 15 . . . . . 6  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  n  e.  dom  f )
4645ralimi 2631 . . . . 5  |-  ( A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  A. n  e.  om  n  e.  dom  f )
47 dfss3 3183 . . . . 5  |-  ( om  C_  dom  f  <->  A. n  e.  om  n  e.  dom  f )
4846, 47sylibr 203 . . . 4  |-  ( A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  om  C_  dom  f )
49 vex 2804 . . . . . 6  |-  f  e. 
_V
5049dmex 4957 . . . . 5  |-  dom  f  e.  _V
5150ssex 4174 . . . 4  |-  ( om  C_  dom  f  ->  om  e.  _V )
5248, 51syl 15 . . 3  |-  ( A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  om  e.  _V )
5352exlimiv 1624 . 2  |-  ( E. f A. n  e. 
om  ( f `  n ) { <. 1o ,  1o >. }  (
f `  suc  n )  ->  om  e.  _V )
5432, 53ax-mp 8 1  |-  om  e.  _V
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   E.wex 1531    = wceq 1632    e. wcel 1696    =/= wne 2459   A.wral 2556   _Vcvv 2801    C_ wss 3165   (/)c0 3468   {csn 3653   <.cop 3656   class class class wbr 4039   Oncon0 4408   suc csuc 4410   omcom 4672   dom cdm 4705   ran crn 4706   Fun wfun 5265   ` cfv 5271   1oc1o 6488
This theorem is referenced by:  axdc2lem  8090  axdc3lem  8092  axdc4lem  8097  axcclem  8099
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230  ax-un 4528  ax-dc 8088
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-suc 4414  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-iota 5235  df-fun 5273  df-fn 5274  df-fv 5279  df-1o 6495
  Copyright terms: Public domain W3C validator