MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cardne Structured version   Visualization version   GIF version

Theorem cardne 9947
Description: No member of a cardinal number of a set is equinumerous to the set. Proposition 10.6(2) of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 9-Jan-2013.)
Assertion
Ref Expression
cardne (𝐴 ∈ (card‘𝐵) → ¬ 𝐴𝐵)

Proof of Theorem cardne
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elfvdm 6915 . 2 (𝐴 ∈ (card‘𝐵) → 𝐵 ∈ dom card)
2 cardon 9926 . . . . . . . . . 10 (card‘𝐵) ∈ On
32oneli 6476 . . . . . . . . 9 (𝐴 ∈ (card‘𝐵) → 𝐴 ∈ On)
4 breq1 5112 . . . . . . . . . 10 (𝑥 = 𝐴 → (𝑥𝐵𝐴𝐵))
54onintss 6413 . . . . . . . . 9 (𝐴 ∈ On → (𝐴𝐵 {𝑥 ∈ On ∣ 𝑥𝐵} ⊆ 𝐴))
63, 5syl 18 . . . . . . . 8 (𝐴 ∈ (card‘𝐵) → (𝐴𝐵 {𝑥 ∈ On ∣ 𝑥𝐵} ⊆ 𝐴))
76adantl 486 . . . . . . 7 ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴𝐵 {𝑥 ∈ On ∣ 𝑥𝐵} ⊆ 𝐴))
8 cardval3 9934 . . . . . . . . 9 (𝐵 ∈ dom card → (card‘𝐵) = {𝑥 ∈ On ∣ 𝑥𝐵})
98sseq1d 3968 . . . . . . . 8 (𝐵 ∈ dom card → ((card‘𝐵) ⊆ 𝐴 {𝑥 ∈ On ∣ 𝑥𝐵} ⊆ 𝐴))
109adantr 485 . . . . . . 7 ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → ((card‘𝐵) ⊆ 𝐴 {𝑥 ∈ On ∣ 𝑥𝐵} ⊆ 𝐴))
117, 10sylibrd 262 . . . . . 6 ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴𝐵 → (card‘𝐵) ⊆ 𝐴))
12 ontri1 6395 . . . . . . . 8 (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
132, 3, 12sylancr 598 . . . . . . 7 (𝐴 ∈ (card‘𝐵) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
1413adantl 486 . . . . . 6 ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
1511, 14sylibd 242 . . . . 5 ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴𝐵 → ¬ 𝐴 ∈ (card‘𝐵)))
1615con2d 135 . . . 4 ((𝐵 ∈ dom card ∧ 𝐴 ∈ (card‘𝐵)) → (𝐴 ∈ (card‘𝐵) → ¬ 𝐴𝐵))
1716ex 417 . . 3 (𝐵 ∈ dom card → (𝐴 ∈ (card‘𝐵) → (𝐴 ∈ (card‘𝐵) → ¬ 𝐴𝐵)))
1817pm2.43d 54 . 2 (𝐵 ∈ dom card → (𝐴 ∈ (card‘𝐵) → ¬ 𝐴𝐵))
191, 18mpcom 39 1 (𝐴 ∈ (card‘𝐵) → ¬ 𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  wcel 2143  {crab 3416  wss 3905   cint 4912   class class class wbr 5109  dom cdm 5661  Oncon0 6360  cfv 6536  cen 8936  cardccrd 9917
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-en 8940  df-card 9921
This theorem is referenced by:  carden2b  9949  cardlim  9954  cardsdomelir  9955
  Copyright terms: Public domain W3C validator