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

Theorem carden2bex 7485
Description: If two numerable sets are equinumerous, then they have equal cardinalities. (Contributed by Jim Kingdon, 30-Aug-2021.)
Assertion
Ref Expression
carden2bex ((𝐴𝐵 ∧ ∃𝑥 ∈ On 𝑥𝐴) → (card‘𝐴) = (card‘𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem carden2bex
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 enen2 7093 . . . . 5 (𝐴𝐵 → (𝑦𝐴𝑦𝐵))
21rabbidv 2801 . . . 4 (𝐴𝐵 → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦𝐵})
32inteqd 3953 . . 3 (𝐴𝐵 {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦𝐵})
43adantr 276 . 2 ((𝐴𝐵 ∧ ∃𝑥 ∈ On 𝑥𝐴) → {𝑦 ∈ On ∣ 𝑦𝐴} = {𝑦 ∈ On ∣ 𝑦𝐵})
5 cardval3ex 7480 . . 3 (∃𝑥 ∈ On 𝑥𝐴 → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
65adantl 277 . 2 ((𝐴𝐵 ∧ ∃𝑥 ∈ On 𝑥𝐴) → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
7 entr 7023 . . . . . 6 ((𝑥𝐴𝐴𝐵) → 𝑥𝐵)
87expcom 116 . . . . 5 (𝐴𝐵 → (𝑥𝐴𝑥𝐵))
98reximdv 2643 . . . 4 (𝐴𝐵 → (∃𝑥 ∈ On 𝑥𝐴 → ∃𝑥 ∈ On 𝑥𝐵))
109imp 124 . . 3 ((𝐴𝐵 ∧ ∃𝑥 ∈ On 𝑥𝐴) → ∃𝑥 ∈ On 𝑥𝐵)
11 cardval3ex 7480 . . 3 (∃𝑥 ∈ On 𝑥𝐵 → (card‘𝐵) = {𝑦 ∈ On ∣ 𝑦𝐵})
1210, 11syl 14 . 2 ((𝐴𝐵 ∧ ∃𝑥 ∈ On 𝑥𝐴) → (card‘𝐵) = {𝑦 ∈ On ∣ 𝑦𝐵})
134, 6, 123eqtr4d 2275 1 ((𝐴𝐵 ∧ ∃𝑥 ∈ On 𝑥𝐴) → (card‘𝐴) = (card‘𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wrex 2521  {crab 2524   cint 3948   class class class wbr 4108  Oncon0 4483  cfv 5351  cen 6972  cardccrd 7472
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-rab 2529  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-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  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-er 6766  df-en 6975  df-card 7474
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator