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

Theorem card2inf 9515
Description: The alternate definition of the cardinal of a set given in cardval2 9951 has the curious property that for non-numerable sets (for which ndmfv 6896 yields ), it still evaluates to a nonempty set, and indeed it contains ω. (Contributed by Mario Carneiro, 15-Jan-2013.) (Revised by Mario Carneiro, 27-Apr-2015.)
Hypothesis
Ref Expression
card2inf.1 𝐴 ∈ V
Assertion
Ref Expression
card2inf (¬ ∃𝑦 ∈ On 𝑦𝐴 → ω ⊆ {𝑥 ∈ On ∣ 𝑥𝐴})
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem card2inf
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 breq1 5113 . . . . 5 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ≺ 𝐴))
2 breq1 5113 . . . . 5 (𝑥 = 𝑛 → (𝑥𝐴𝑛𝐴))
3 breq1 5113 . . . . 5 (𝑥 = suc 𝑛 → (𝑥𝐴 ↔ suc 𝑛𝐴))
4 0elon 6390 . . . . . . . 8 ∅ ∈ On
5 breq1 5113 . . . . . . . . 9 (𝑦 = ∅ → (𝑦𝐴 ↔ ∅ ≈ 𝐴))
65rspcev 3591 . . . . . . . 8 ((∅ ∈ On ∧ ∅ ≈ 𝐴) → ∃𝑦 ∈ On 𝑦𝐴)
74, 6mpan 690 . . . . . . 7 (∅ ≈ 𝐴 → ∃𝑦 ∈ On 𝑦𝐴)
87con3i 154 . . . . . 6 (¬ ∃𝑦 ∈ On 𝑦𝐴 → ¬ ∅ ≈ 𝐴)
9 card2inf.1 . . . . . . . 8 𝐴 ∈ V
1090dom 9077 . . . . . . 7 ∅ ≼ 𝐴
11 brsdom 8949 . . . . . . 7 (∅ ≺ 𝐴 ↔ (∅ ≼ 𝐴 ∧ ¬ ∅ ≈ 𝐴))
1210, 11mpbiran 709 . . . . . 6 (∅ ≺ 𝐴 ↔ ¬ ∅ ≈ 𝐴)
138, 12sylibr 234 . . . . 5 (¬ ∃𝑦 ∈ On 𝑦𝐴 → ∅ ≺ 𝐴)
14 sucdom2 9173 . . . . . . . 8 (𝑛𝐴 → suc 𝑛𝐴)
1514ad2antll 729 . . . . . . 7 ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦𝐴𝑛𝐴)) → suc 𝑛𝐴)
16 nnon 7851 . . . . . . . . . 10 (𝑛 ∈ ω → 𝑛 ∈ On)
17 onsuc 7790 . . . . . . . . . 10 (𝑛 ∈ On → suc 𝑛 ∈ On)
18 breq1 5113 . . . . . . . . . . . 12 (𝑦 = suc 𝑛 → (𝑦𝐴 ↔ suc 𝑛𝐴))
1918rspcev 3591 . . . . . . . . . . 11 ((suc 𝑛 ∈ On ∧ suc 𝑛𝐴) → ∃𝑦 ∈ On 𝑦𝐴)
2019ex 412 . . . . . . . . . 10 (suc 𝑛 ∈ On → (suc 𝑛𝐴 → ∃𝑦 ∈ On 𝑦𝐴))
2116, 17, 203syl 18 . . . . . . . . 9 (𝑛 ∈ ω → (suc 𝑛𝐴 → ∃𝑦 ∈ On 𝑦𝐴))
2221con3dimp 408 . . . . . . . 8 ((𝑛 ∈ ω ∧ ¬ ∃𝑦 ∈ On 𝑦𝐴) → ¬ suc 𝑛𝐴)
2322adantrr 717 . . . . . . 7 ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦𝐴𝑛𝐴)) → ¬ suc 𝑛𝐴)
24 brsdom 8949 . . . . . . 7 (suc 𝑛𝐴 ↔ (suc 𝑛𝐴 ∧ ¬ suc 𝑛𝐴))
2515, 23, 24sylanbrc 583 . . . . . 6 ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦𝐴𝑛𝐴)) → suc 𝑛𝐴)
2625exp32 420 . . . . 5 (𝑛 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦𝐴 → (𝑛𝐴 → suc 𝑛𝐴)))
271, 2, 3, 13, 26finds2 7877 . . . 4 (𝑥 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦𝐴𝑥𝐴))
2827com12 32 . . 3 (¬ ∃𝑦 ∈ On 𝑦𝐴 → (𝑥 ∈ ω → 𝑥𝐴))
2928ralrimiv 3125 . 2 (¬ ∃𝑦 ∈ On 𝑦𝐴 → ∀𝑥 ∈ ω 𝑥𝐴)
30 omsson 7849 . . 3 ω ⊆ On
31 ssrab 4039 . . 3 (ω ⊆ {𝑥 ∈ On ∣ 𝑥𝐴} ↔ (ω ⊆ On ∧ ∀𝑥 ∈ ω 𝑥𝐴))
3230, 31mpbiran 709 . 2 (ω ⊆ {𝑥 ∈ On ∣ 𝑥𝐴} ↔ ∀𝑥 ∈ ω 𝑥𝐴)
3329, 32sylibr 234 1 (¬ ∃𝑦 ∈ On 𝑦𝐴 → ω ⊆ {𝑥 ∈ On ∣ 𝑥𝐴})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wcel 2109  wral 3045  wrex 3054  {crab 3408  Vcvv 3450  wss 3917  c0 4299   class class class wbr 5110  Oncon0 6335  suc csuc 6337  ωcom 7845  cen 8918  cdom 8919  csdm 8920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-om 7846  df-1o 8437  df-en 8922  df-dom 8923  df-sdom 8924  df-fin 8925
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator