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

Theorem enm 7070
Description: A set equinumerous to an inhabited set is inhabited. (Contributed by Jim Kingdon, 19-May-2020.)
Assertion
Ref Expression
enm  |-  ( ( A  ~~  B  /\  E. x  x  e.  A
)  ->  E. y 
y  e.  B )
Distinct variable groups:    x, y, A   
x, B, y

Proof of Theorem enm
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 bren 6982 . . . . 5  |-  ( A 
~~  B  <->  E. f 
f : A -1-1-onto-> B )
2 f1of 5613 . . . . . . 7  |-  ( f : A -1-1-onto-> B  ->  f : A
--> B )
3 ffvelcdm 5809 . . . . . . . . 9  |-  ( ( f : A --> B  /\  x  e.  A )  ->  ( f `  x
)  e.  B )
4 elex2 2829 . . . . . . . . 9  |-  ( ( f `  x )  e.  B  ->  E. y 
y  e.  B )
53, 4syl 14 . . . . . . . 8  |-  ( ( f : A --> B  /\  x  e.  A )  ->  E. y  y  e.  B )
65ex 115 . . . . . . 7  |-  ( f : A --> B  -> 
( x  e.  A  ->  E. y  y  e.  B ) )
72, 6syl 14 . . . . . 6  |-  ( f : A -1-1-onto-> B  ->  ( x  e.  A  ->  E. y 
y  e.  B ) )
87exlimiv 1647 . . . . 5  |-  ( E. f  f : A -1-1-onto-> B  ->  ( x  e.  A  ->  E. y  y  e.  B ) )
91, 8sylbi 121 . . . 4  |-  ( A 
~~  B  ->  (
x  e.  A  ->  E. y  y  e.  B ) )
109com12 30 . . 3  |-  ( x  e.  A  ->  ( A  ~~  B  ->  E. y 
y  e.  B ) )
1110exlimiv 1647 . 2  |-  ( E. x  x  e.  A  ->  ( A  ~~  B  ->  E. y  y  e.  B ) )
1211impcom 125 1  |-  ( ( A  ~~  B  /\  E. x  x  e.  A
)  ->  E. y 
y  e.  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   E.wex 1541    e. wcel 2203   class class class wbr 4108   -->wf 5347   -1-1-onto->wf1o 5350   ` cfv 5351    ~~ cen 6972
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-sbc 3042  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-en 6975
This theorem is referenced by:  ssfilem  7129  ssfilemd  7131  diffitest  7143
  Copyright terms: Public domain W3C validator