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

Theorem dcomex 8740
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 4603 . . 3  |-  { <. 1o ,  1o >. }  e.  _V
2 1on 7055 . . . . . . . . . 10  |-  1o  e.  On
32elexi 3044 . . . . . . . . 9  |-  1o  e.  _V
43, 3fvsn 6006 . . . . . . . 8  |-  ( {
<. 1o ,  1o >. } `
 1o )  =  1o
53, 3funsn 5544 . . . . . . . . 9  |-  Fun  { <. 1o ,  1o >. }
63snid 3972 . . . . . . . . . 10  |-  1o  e.  { 1o }
73dmsnop 5390 . . . . . . . . . 10  |-  dom  { <. 1o ,  1o >. }  =  { 1o }
86, 7eleqtrri 2469 . . . . . . . . 9  |-  1o  e.  dom  { <. 1o ,  1o >. }
9 funbrfvb 5816 . . . . . . . . 9  |-  ( ( Fun  { <. 1o ,  1o >. }  /\  1o  e.  dom  { <. 1o ,  1o >. } )  -> 
( ( { <. 1o ,  1o >. } `  1o )  =  1o  <->  1o { <. 1o ,  1o >. } 1o ) )
105, 8, 9mp2an 670 . . . . . . . 8  |-  ( ( { <. 1o ,  1o >. } `  1o )  =  1o  <->  1o { <. 1o ,  1o >. } 1o )
114, 10mpbi 208 . . . . . . 7  |-  1o { <. 1o ,  1o >. } 1o
12 breq12 4372 . . . . . . . 8  |-  ( ( s  =  1o  /\  t  =  1o )  ->  ( s { <. 1o ,  1o >. } t  <-> 
1o { <. 1o ,  1o >. } 1o ) )
133, 3, 12spc2ev 3127 . . . . . . 7  |-  ( 1o { <. 1o ,  1o >. } 1o  ->  E. s E. t  s { <. 1o ,  1o >. } t )
1411, 13ax-mp 5 . . . . . 6  |-  E. s E. t  s { <. 1o ,  1o >. } t
15 breq 4369 . . . . . . 7  |-  ( x  =  { <. 1o ,  1o >. }  ->  (
s x t  <->  s { <. 1o ,  1o >. } t ) )
16152exbidv 1724 . . . . . 6  |-  ( x  =  { <. 1o ,  1o >. }  ->  ( E. s E. t  s x t  <->  E. s E. t  s { <. 1o ,  1o >. } t ) )
1714, 16mpbiri 233 . . . . 5  |-  ( x  =  { <. 1o ,  1o >. }  ->  E. s E. t  s x
t )
18 ssid 3436 . . . . . . 7  |-  { 1o }  C_  { 1o }
193rnsnop 5397 . . . . . . 7  |-  ran  { <. 1o ,  1o >. }  =  { 1o }
2018, 19, 73sstr4i 3456 . . . . . 6  |-  ran  { <. 1o ,  1o >. } 
C_  dom  { <. 1o ,  1o >. }
21 rneq 5141 . . . . . . 7  |-  ( x  =  { <. 1o ,  1o >. }  ->  ran  x  =  ran  { <. 1o ,  1o >. } )
22 dmeq 5116 . . . . . . 7  |-  ( x  =  { <. 1o ,  1o >. }  ->  dom  x  =  dom  { <. 1o ,  1o >. } )
2321, 22sseq12d 3446 . . . . . 6  |-  ( x  =  { <. 1o ,  1o >. }  ->  ( ran  x  C_  dom  x  <->  ran  { <. 1o ,  1o >. }  C_  dom  { <. 1o ,  1o >. } ) )
2420, 23mpbiri 233 . . . . 5  |-  ( x  =  { <. 1o ,  1o >. }  ->  ran  x  C_  dom  x )
25 pm5.5 334 . . . . 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 659 . . . 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 4369 . . . . . 6  |-  ( x  =  { <. 1o ,  1o >. }  ->  (
( f `  n
) x ( f `
 suc  n )  <->  ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n ) ) )
2827ralbidv 2821 . . . . 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 1722 . . . 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 253 . . 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 8739 . . 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 3086 . 2  |-  E. f A. n  e.  om  ( f `  n
) { <. 1o ,  1o >. }  ( f `
 suc  n )
33 1n0 7063 . . . . . . . 8  |-  1o  =/=  (/)
34 df-br 4368 . . . . . . . . 9  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  <->  <. ( f `
 n ) ,  ( f `  suc  n ) >.  e.  { <. 1o ,  1o >. } )
35 elsni 3969 . . . . . . . . . 10  |-  ( <.
( f `  n
) ,  ( f `
 suc  n ) >.  e.  { <. 1o ,  1o >. }  ->  <. (
f `  n ) ,  ( f `  suc  n ) >.  =  <. 1o ,  1o >. )
36 fvex 5784 . . . . . . . . . . 11  |-  ( f `
 n )  e. 
_V
37 fvex 5784 . . . . . . . . . . 11  |-  ( f `
 suc  n )  e.  _V
3836, 37opth1 4635 . . . . . . . . . 10  |-  ( <.
( f `  n
) ,  ( f `
 suc  n ) >.  =  <. 1o ,  1o >.  ->  ( f `  n )  =  1o )
3935, 38syl 16 . . . . . . . . 9  |-  ( <.
( f `  n
) ,  ( f `
 suc  n ) >.  e.  { <. 1o ,  1o >. }  ->  (
f `  n )  =  1o )
4034, 39sylbi 195 . . . . . . . 8  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  (
f `  n )  =  1o )
41 tz6.12i 5794 . . . . . . . 8  |-  ( 1o  =/=  (/)  ->  ( (
f `  n )  =  1o  ->  n f 1o ) )
4233, 40, 41mpsyl 63 . . . . . . 7  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  n
f 1o )
43 vex 3037 . . . . . . . 8  |-  n  e. 
_V
4443, 3breldm 5120 . . . . . . 7  |-  ( n f 1o  ->  n  e.  dom  f )
4542, 44syl 16 . . . . . 6  |-  ( ( f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  n  e.  dom  f )
4645ralimi 2775 . . . . 5  |-  ( A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  A. n  e.  om  n  e.  dom  f )
47 dfss3 3407 . . . . 5  |-  ( om  C_  dom  f  <->  A. n  e.  om  n  e.  dom  f )
4846, 47sylibr 212 . . . 4  |-  ( A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  om  C_  dom  f )
49 vex 3037 . . . . . 6  |-  f  e. 
_V
5049dmex 6632 . . . . 5  |-  dom  f  e.  _V
5150ssex 4509 . . . 4  |-  ( om  C_  dom  f  ->  om  e.  _V )
5248, 51syl 16 . . 3  |-  ( A. n  e.  om  (
f `  n ) { <. 1o ,  1o >. }  ( f `  suc  n )  ->  om  e.  _V )
5352exlimiv 1730 . 2  |-  ( E. f A. n  e. 
om  ( f `  n ) { <. 1o ,  1o >. }  (
f `  suc  n )  ->  om  e.  _V )
5432, 53ax-mp 5 1  |-  om  e.  _V
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 367    = wceq 1399   E.wex 1620    e. wcel 1826    =/= wne 2577   A.wral 2732   _Vcvv 3034    C_ wss 3389   (/)c0 3711   {csn 3944   <.cop 3950   class class class wbr 4367   Oncon0 4792   suc csuc 4794   dom cdm 4913   ran crn 4914   Fun wfun 5490   ` cfv 5496   omcom 6599   1oc1o 7041
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-8 1828  ax-9 1830  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360  ax-sep 4488  ax-nul 4496  ax-pr 4601  ax-un 6491  ax-dc 8739
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-eu 2222  df-mo 2223  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-ne 2579  df-ral 2737  df-rex 2738  df-rab 2741  df-v 3036  df-sbc 3253  df-dif 3392  df-un 3394  df-in 3396  df-ss 3403  df-pss 3405  df-nul 3712  df-if 3858  df-pw 3929  df-sn 3945  df-pr 3947  df-tp 3949  df-op 3951  df-uni 4164  df-br 4368  df-opab 4426  df-tr 4461  df-eprel 4705  df-id 4709  df-po 4714  df-so 4715  df-fr 4752  df-we 4754  df-ord 4795  df-on 4796  df-suc 4798  df-xp 4919  df-rel 4920  df-cnv 4921  df-co 4922  df-dm 4923  df-rn 4924  df-iota 5460  df-fun 5498  df-fn 5499  df-fv 5504  df-1o 7048
This theorem is referenced by:  axdc2lem  8741  axdc3lem  8743  axdc4lem  8748  axcclem  8750
  Copyright terms: Public domain W3C validator