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

Theorem carden2bex 7385
Description: If two numerable sets are equinumerous, then they have equal cardinalities. (Contributed by Jim Kingdon, 30-Aug-2021.)
Assertion
Ref Expression
carden2bex  |-  ( ( A  ~~  B  /\  E. x  e.  On  x  ~~  A )  ->  ( card `  A )  =  ( card `  B
) )
Distinct variable groups:    x, A    x, B

Proof of Theorem carden2bex
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 enen2 7022 . . . . 5  |-  ( A 
~~  B  ->  (
y  ~~  A  <->  y  ~~  B ) )
21rabbidv 2789 . . . 4  |-  ( A 
~~  B  ->  { y  e.  On  |  y 
~~  A }  =  { y  e.  On  |  y  ~~  B }
)
32inteqd 3931 . . 3  |-  ( A 
~~  B  ->  |^| { y  e.  On  |  y 
~~  A }  =  |^| { y  e.  On  |  y  ~~  B }
)
43adantr 276 . 2  |-  ( ( A  ~~  B  /\  E. x  e.  On  x  ~~  A )  ->  |^| { y  e.  On  |  y 
~~  A }  =  |^| { y  e.  On  |  y  ~~  B }
)
5 cardval3ex 7380 . . 3  |-  ( E. x  e.  On  x  ~~  A  ->  ( card `  A )  =  |^| { y  e.  On  | 
y  ~~  A }
)
65adantl 277 . 2  |-  ( ( A  ~~  B  /\  E. x  e.  On  x  ~~  A )  ->  ( card `  A )  = 
|^| { y  e.  On  |  y  ~~  A }
)
7 entr 6953 . . . . . 6  |-  ( ( x  ~~  A  /\  A  ~~  B )  ->  x  ~~  B )
87expcom 116 . . . . 5  |-  ( A 
~~  B  ->  (
x  ~~  A  ->  x 
~~  B ) )
98reximdv 2631 . . . 4  |-  ( A 
~~  B  ->  ( E. x  e.  On  x  ~~  A  ->  E. x  e.  On  x  ~~  B
) )
109imp 124 . . 3  |-  ( ( A  ~~  B  /\  E. x  e.  On  x  ~~  A )  ->  E. x  e.  On  x  ~~  B
)
11 cardval3ex 7380 . . 3  |-  ( E. x  e.  On  x  ~~  B  ->  ( card `  B )  =  |^| { y  e.  On  | 
y  ~~  B }
)
1210, 11syl 14 . 2  |-  ( ( A  ~~  B  /\  E. x  e.  On  x  ~~  A )  ->  ( card `  B )  = 
|^| { y  e.  On  |  y  ~~  B }
)
134, 6, 123eqtr4d 2272 1  |-  ( ( A  ~~  B  /\  E. x  e.  On  x  ~~  A )  ->  ( card `  A )  =  ( card `  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395   E.wrex 2509   {crab 2512   |^|cint 3926   class class class wbr 4086   Oncon0 4458   ` cfv 5324    ~~ cen 6902   cardccrd 7372
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-er 6697  df-en 6905  df-card 7374
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator