Theorem card2inf 9552

Description: The alternate definition of the cardinal of a set given in cardval2 10075 has the curious property that for non-numerable sets (for which ndmfv 6917 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.

Step	Hyp	Ref	Expression
1		breq1 5105	. . . . 5 ⊢ (𝑥 = ∅ → (𝑥 ≺ 𝐴 ↔ ∅ ≺ 𝐴))
2		breq1 5105	. . . . 5 ⊢ (𝑥 = 𝑛 → (𝑥 ≺ 𝐴 ↔ 𝑛 ≺ 𝐴))
3		breq1 5105	. . . . 5 ⊢ (𝑥 = suc 𝑛 → (𝑥 ≺ 𝐴 ↔ suc 𝑛 ≺ 𝐴))
4		0elon 6418	. . . . . . . 8 ⊢ ∅ ∈ On
5		breq1 5105	. . . . . . . . 9 ⊢ (𝑦 = ∅ → (𝑦 ≈ 𝐴 ↔ ∅ ≈ 𝐴))
6	5	rspcev 3576	. . . . . . . 8 ⊢ ((∅ ∈ On ∧ ∅ ≈ 𝐴) → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)
7	4, 6	mpan 703	. . . . . . 7 ⊢ (∅ ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)
8	7	con3i 155	. . . . . 6 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ¬ ∅ ≈ 𝐴)
9		card2inf.1	. . . . . . . 8 ⊢ 𝐴 ∈ V
10	9	0dom 9129	. . . . . . 7 ⊢ ∅ ≼ 𝐴
11		brsdom 9004	. . . . . . 7 ⊢ (∅ ≺ 𝐴 ↔ (∅ ≼ 𝐴 ∧ ¬ ∅ ≈ 𝐴))
12	10, 11	mpbiran 722	. . . . . 6 ⊢ (∅ ≺ 𝐴 ↔ ¬ ∅ ≈ 𝐴)
13	8, 12	sylibr 237	. . . . 5 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∅ ≺ 𝐴)
14		sucdom2 9221	. . . . . . . 8 ⊢ (𝑛 ≺ 𝐴 → suc 𝑛 ≼ 𝐴)
15	14	ad2antll 742	. . . . . . 7 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → suc 𝑛 ≼ 𝐴)
16		nnon 7883	. . . . . . . . . 10 ⊢ (𝑛 ∈ ω → 𝑛 ∈ On)
17		onsuc 7824	. . . . . . . . . 10 ⊢ (𝑛 ∈ On → suc 𝑛 ∈ On)
18		breq1 5105	. . . . . . . . . . . 12 ⊢ (𝑦 = suc 𝑛 → (𝑦 ≈ 𝐴 ↔ suc 𝑛 ≈ 𝐴))
19	18	rspcev 3576	. . . . . . . . . . 11 ⊢ ((suc 𝑛 ∈ On ∧ suc 𝑛 ≈ 𝐴) → ∃𝑦 ∈ On 𝑦 ≈ 𝐴)
20	19	ex 418	. . . . . . . . . 10 ⊢ (suc 𝑛 ∈ On → (suc 𝑛 ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴))
21	16, 17, 20	3syl 19	. . . . . . . . 9 ⊢ (𝑛 ∈ ω → (suc 𝑛 ≈ 𝐴 → ∃𝑦 ∈ On 𝑦 ≈ 𝐴))
22	21	con3dimp 414	. . . . . . . 8 ⊢ ((𝑛 ∈ ω ∧ ¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴) → ¬ suc 𝑛 ≈ 𝐴)
23	22	adantrr 730	. . . . . . 7 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → ¬ suc 𝑛 ≈ 𝐴)
24		brsdom 9004	. . . . . . 7 ⊢ (suc 𝑛 ≺ 𝐴 ↔ (suc 𝑛 ≼ 𝐴 ∧ ¬ suc 𝑛 ≈ 𝐴))
25	15, 23, 24	sylanbrc 595	. . . . . 6 ⊢ ((𝑛 ∈ ω ∧ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 ∧ 𝑛 ≺ 𝐴)) → suc 𝑛 ≺ 𝐴)
26	25	exp32 426	. . . . 5 ⊢ (𝑛 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (𝑛 ≺ 𝐴 → suc 𝑛 ≺ 𝐴)))
27	1, 2, 3, 13, 26	finds2 7910	. . . 4 ⊢ (𝑥 ∈ ω → (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → 𝑥 ≺ 𝐴))
28	27	com12 33	. . 3 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → (𝑥 ∈ ω → 𝑥 ≺ 𝐴))
29	28	ralrimiv 3153	. 2 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ∀𝑥 ∈ ω 𝑥 ≺ 𝐴)
30		omsson 7881	. . 3 ⊢ ω ⊆ On
31		ssrab 3996	. . 3 ⊢ (ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} ↔ (ω ⊆ On ∧ ∀𝑥 ∈ ω 𝑥 ≺ 𝐴))
32	30, 31	mpbiran 722	. 2 ⊢ (ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴} ↔ ∀𝑥 ∈ ω 𝑥 ≺ 𝐴)
33	29, 32	sylibr 237	1 ⊢ (¬ ∃𝑦 ∈ On 𝑦 ≈ 𝐴 → ω ⊆ {𝑥 ∈ On ∣ 𝑥 ≺ 𝐴})

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  {crab 3412  Vcvv 3450   ⊆ wss 3895  ∅c0 4278   class class class wbr 5102  Oncon0 6362  suc csuc 6364  ωcom 7877   ≈ cen 8973   ≼ cdom 8974   ≺ csdm 8975

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-om 7878  df-1o 8479  df-en 8977  df-dom 8978  df-sdom 8979  df-fin 8980

This theorem is used by: (None)