Theorem cardmin2 9959

Description: The smallest ordinal that strictly dominates a set is a cardinal, if it exists. (Contributed by Mario Carneiro, 2-Feb-2013.)

Assertion

Ref	Expression
cardmin2	⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 ↔ (card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})

Distinct variable group:   𝑥,𝐴

Proof of Theorem cardmin2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		onintrab2 7776	. . . 4 ⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On)
2	1	biimpi 216	. . 3 ⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 → ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On)
3	2	adantr 480	. . . . . 6 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On)
4		eloni 6345	. . . . . . . 8 ⊢ (∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On → Ord ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
5		ordelss 6351	. . . . . . . 8 ⊢ ((Ord ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ⊆ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
6	4, 5	sylan 580	. . . . . . 7 ⊢ ((∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ⊆ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
7	1, 6	sylanb 581	. . . . . 6 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ⊆ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
8		ssdomg 8974	. . . . . 6 ⊢ (∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On → (𝑦 ⊆ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → 𝑦 ≼ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
9	3, 7, 8	sylc 65	. . . . 5 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ≼ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
10		onelon 6360	. . . . . . . 8 ⊢ ((∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ∈ On)
11	1, 10	sylanb 581	. . . . . . 7 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ∈ On)
12		nfcv 2892	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥𝐴
13		nfcv 2892	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥 ≺
14		nfrab1 3429	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}
15	14	nfint 4923	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}
16	12, 13, 15	nfbr 5157	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥 𝐴 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}
17		breq2 5114	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → (𝐴 ≺ 𝑥 ↔ 𝐴 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
18	16, 17	onminsb 7773	. . . . . . . . . . . 12 ⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 → 𝐴 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
19		sdomentr 9081	. . . . . . . . . . . 12 ⊢ ((𝐴 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∧ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦) → 𝐴 ≺ 𝑦)
20	18, 19	sylan 580	. . . . . . . . . . 11 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦) → 𝐴 ≺ 𝑦)
21		breq2 5114	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → (𝐴 ≺ 𝑥 ↔ 𝐴 ≺ 𝑦))
22	21	elrab 3662	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ↔ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦))
23		ssrab2 4046	. . . . . . . . . . . . . 14 ⊢ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ⊆ On
24		onnmin 7777	. . . . . . . . . . . . . 14 ⊢ (({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ⊆ On ∧ 𝑦 ∈ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → ¬ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
25	23, 24	mpan 690	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → ¬ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
26	22, 25	sylbir 235	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) → ¬ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
27	26	expcom 413	. . . . . . . . . . 11 ⊢ (𝐴 ≺ 𝑦 → (𝑦 ∈ On → ¬ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
28	20, 27	syl 17	. . . . . . . . . 10 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦) → (𝑦 ∈ On → ¬ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
29	28	impancom 451	. . . . . . . . 9 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ On) → (∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦 → ¬ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
30	29	con2d 134	. . . . . . . 8 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ On) → (𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → ¬ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦))
31	30	impancom 451	. . . . . . 7 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → (𝑦 ∈ On → ¬ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦))
32	11, 31	mpd 15	. . . . . 6 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → ¬ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦)
33		ensym 8977	. . . . . 6 ⊢ (𝑦 ≈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≈ 𝑦)
34	32, 33	nsyl 140	. . . . 5 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → ¬ 𝑦 ≈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
35		brsdom 8949	. . . . 5 ⊢ (𝑦 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ↔ (𝑦 ≼ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∧ ¬ 𝑦 ≈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
36	9, 34, 35	sylanbrc 583	. . . 4 ⊢ ((∃𝑥 ∈ On 𝐴 ≺ 𝑥 ∧ 𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) → 𝑦 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
37	36	ralrimiva 3126	. . 3 ⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 → ∀𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}𝑦 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
38		iscard 9935	. . 3 ⊢ ((card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ↔ (∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ On ∧ ∀𝑦 ∈ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}𝑦 ≺ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}))
39	2, 37, 38	sylanbrc 583	. 2 ⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 → (card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
40		vprc 5273	. . . . . 6 ⊢ ¬ V ∈ V
41		inteq 4916	. . . . . . . 8 ⊢ ({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = ∅ → ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = ∩ ∅)
42		int0 4929	. . . . . . . 8 ⊢ ∩ ∅ = V
43	41, 42	eqtrdi 2781	. . . . . . 7 ⊢ ({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = ∅ → ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = V)
44	43	eleq1d 2814	. . . . . 6 ⊢ ({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = ∅ → (∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ V ↔ V ∈ V))
45	40, 44	mtbiri 327	. . . . 5 ⊢ ({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = ∅ → ¬ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ V)
46		fvex 6874	. . . . . 6 ⊢ (card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) ∈ V
47		eleq1 2817	. . . . . 6 ⊢ ((card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → ((card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) ∈ V ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ V))
48	46, 47	mpbii 233	. . . . 5 ⊢ ((card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ∈ V)
49	45, 48	nsyl 140	. . . 4 ⊢ ({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} = ∅ → ¬ (card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})
50	49	necon2ai 2955	. . 3 ⊢ ((card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≠ ∅)
51		rabn0 4355	. . 3 ⊢ ({𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} ≠ ∅ ↔ ∃𝑥 ∈ On 𝐴 ≺ 𝑥)
52	50, 51	sylib 218	. 2 ⊢ ((card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥} → ∃𝑥 ∈ On 𝐴 ≺ 𝑥)
53	39, 52	impbii 209	1 ⊢ (∃𝑥 ∈ On 𝐴 ≺ 𝑥 ↔ (card‘∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥}) = ∩ {𝑥 ∈ On ∣ 𝐴 ≺ 𝑥})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2926  ∀wral 3045  ∃wrex 3054  {crab 3408  Vcvv 3450   ⊆ wss 3917  ∅c0 4299  ∩ cint 4913   class class class wbr 5110  Ord word 6334  Oncon0 6335  ‘cfv 6514   ≈ cen 8918   ≼ cdom 8919   ≺ csdm 8920  cardccrd 9895

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-pow 5323  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-rab 3409  df-v 3452  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-int 4914  df-br 5111  df-opab 5173  df-mpt 5192  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-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-er 8674  df-en 8922  df-dom 8923  df-sdom 8924  df-card 9899

This theorem is referenced by: (None)