ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  0ct Unicode version

Theorem 0ct 7437
Description: The empty set is countable. Remark of [BauerSwan], p. 14:3 which also has the definition of countable used here. (Contributed by Jim Kingdon, 13-Mar-2023.)
Assertion
Ref Expression
0ct  |-  E. f 
f : om -onto-> ( (/) 1o )

Proof of Theorem 0ct
Dummy variables  y  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0lt1o 6703 . . . . 5  |-  (/)  e.  1o
2 djurcl 7382 . . . . 5  |-  ( (/)  e.  1o  ->  (inr `  (/) )  e.  ( (/) 1o ) )
31, 2ax-mp 5 . . . 4  |-  (inr `  (/) )  e.  ( (/) 1o )
43fconst6 5587 . . 3  |-  ( om 
X.  { (inr `  (/) ) } ) : om --> ( (/) 1o )
5 peano1 4736 . . . . 5  |-  (/)  e.  om
6 rex0 3539 . . . . . . . . 9  |-  -.  E. w  e.  (/)  y  =  (inl `  w )
7 djur 7399 . . . . . . . . . . 11  |-  ( y  e.  ( (/) 1o )  <-> 
( E. w  e.  (/)  y  =  (inl `  w )  \/  E. w  e.  1o  y  =  (inr `  w )
) )
87biimpi 120 . . . . . . . . . 10  |-  ( y  e.  ( (/) 1o )  ->  ( E. w  e.  (/)  y  =  (inl
`  w )  \/ 
E. w  e.  1o  y  =  (inr `  w
) ) )
98ord 736 . . . . . . . . 9  |-  ( y  e.  ( (/) 1o )  ->  ( -.  E. w  e.  (/)  y  =  (inl `  w )  ->  E. w  e.  1o  y  =  (inr `  w
) ) )
106, 9mpi 15 . . . . . . . 8  |-  ( y  e.  ( (/) 1o )  ->  E. w  e.  1o  y  =  (inr `  w
) )
11 df1o2 6691 . . . . . . . . 9  |-  1o  =  { (/) }
1211rexeqi 2754 . . . . . . . 8  |-  ( E. w  e.  1o  y  =  (inr `  w )  <->  E. w  e.  { (/) } y  =  (inr `  w ) )
1310, 12sylib 122 . . . . . . 7  |-  ( y  e.  ( (/) 1o )  ->  E. w  e.  { (/)
} y  =  (inr
`  w ) )
14 0ex 4255 . . . . . . . 8  |-  (/)  e.  _V
15 fveq2 5690 . . . . . . . . 9  |-  ( w  =  (/)  ->  (inr `  w )  =  (inr
`  (/) ) )
1615eqeq2d 2250 . . . . . . . 8  |-  ( w  =  (/)  ->  ( y  =  (inr `  w
)  <->  y  =  (inr
`  (/) ) ) )
1714, 16rexsn 3749 . . . . . . 7  |-  ( E. w  e.  { (/) } y  =  (inr `  w )  <->  y  =  (inr `  (/) ) )
1813, 17sylib 122 . . . . . 6  |-  ( y  e.  ( (/) 1o )  ->  y  =  (inr
`  (/) ) )
193elexi 2834 . . . . . . . 8  |-  (inr `  (/) )  e.  _V
2019fvconst2 5922 . . . . . . 7  |-  ( (/)  e.  om  ->  ( ( om  X.  { (inr `  (/) ) } ) `  (/) )  =  (inr `  (/) ) )
215, 20ax-mp 5 . . . . . 6  |-  ( ( om  X.  { (inr
`  (/) ) } ) `
 (/) )  =  (inr
`  (/) )
2218, 21eqtr4di 2289 . . . . 5  |-  ( y  e.  ( (/) 1o )  ->  y  =  ( ( om  X.  {
(inr `  (/) ) } ) `  (/) ) )
23 fveq2 5690 . . . . . 6  |-  ( z  =  (/)  ->  ( ( om  X.  { (inr
`  (/) ) } ) `
 z )  =  ( ( om  X.  { (inr `  (/) ) } ) `  (/) ) )
2423rspceeqv 2948 . . . . 5  |-  ( (
(/)  e.  om  /\  y  =  ( ( om 
X.  { (inr `  (/) ) } ) `  (/) ) )  ->  E. z  e.  om  y  =  ( ( om  X.  {
(inr `  (/) ) } ) `  z ) )
255, 22, 24sylancr 418 . . . 4  |-  ( y  e.  ( (/) 1o )  ->  E. z  e.  om  y  =  ( ( om  X.  { (inr `  (/) ) } ) `  z ) )
2625rgen 2603 . . 3  |-  A. y  e.  ( (/) 1o ) E. z  e.  om  y  =  ( ( om 
X.  { (inr `  (/) ) } ) `  z )
27 dffo3 5846 . . 3  |-  ( ( om  X.  { (inr
`  (/) ) } ) : om -onto-> ( (/) 1o )  <->  ( ( om 
X.  { (inr `  (/) ) } ) : om --> ( (/) 1o )  /\  A. y  e.  ( (/) 1o ) E. z  e.  om  y  =  ( ( om 
X.  { (inr `  (/) ) } ) `  z ) ) )
284, 26, 27mpbir2an 955 . 2  |-  ( om 
X.  { (inr `  (/) ) } ) : om -onto-> ( (/) 1o )
29 omex 4735 . . . 4  |-  om  e.  _V
3019snex 4317 . . . 4  |-  { (inr
`  (/) ) }  e.  _V
3129, 30xpex 4886 . . 3  |-  ( om 
X.  { (inr `  (/) ) } )  e. 
_V
32 foeq1 5606 . . 3  |-  ( f  =  ( om  X.  { (inr `  (/) ) } )  ->  ( f : om -onto-> ( (/) 1o )  <-> 
( om  X.  {
(inr `  (/) ) } ) : om -onto-> ( (/) 1o ) ) )
3331, 32spcev 2920 . 2  |-  ( ( om  X.  { (inr
`  (/) ) } ) : om -onto-> ( (/) 1o )  ->  E. f 
f : om -onto-> ( (/) 1o ) )
3428, 33ax-mp 5 1  |-  E. f 
f : om -onto-> ( (/) 1o )
Colors of variables: wff set class
Syntax hints:   -. wn 3    \/ wo 720    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528   E.wrex 2529   (/)c0 3520   {csn 3705   omcom 4732    X. cxp 4767   -->wf 5368   -onto->wfo 5370   ` cfv 5372   1oc1o 6670   ⊔ cdju 7367  inlcinl 7375  inrcinr 7376
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1st 6364  df-2nd 6365  df-1o 6677  df-dju 7368  df-inl 7377  df-inr 7378
This theorem is referenced by:  enumct  7445
  Copyright terms: Public domain W3C validator