Theorem cfub 10318

Description: An upper bound on cofinality. (Contributed by NM, 25-Apr-2004.) (Revised by Mario Carneiro, 15-Sep-2013.)

Assertion

Ref	Expression
cfub	⊢ (cf‘𝐴) ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))}

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem cfub

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cfval 10316	. . 3 ⊢ (𝐴 ∈ On → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))})
2		dfss3 3997	. . . . . . . . 9 ⊢ (𝐴 ⊆ ∪ 𝑦 ↔ ∀𝑧 ∈ 𝐴 𝑧 ∈ ∪ 𝑦)
3		ssel 4002	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ⊆ 𝐴 → (𝑤 ∈ 𝑦 → 𝑤 ∈ 𝐴))
4		onelon 6420	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ On ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ On)
5	4	ex 412	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ On → (𝑤 ∈ 𝐴 → 𝑤 ∈ On))
6	3, 5	sylan9r 508	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → (𝑤 ∈ 𝑦 → 𝑤 ∈ On))
7		onelss 6437	. . . . . . . . . . . . . . 15 ⊢ (𝑤 ∈ On → (𝑧 ∈ 𝑤 → 𝑧 ⊆ 𝑤))
8	6, 7	syl6 35	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → (𝑤 ∈ 𝑦 → (𝑧 ∈ 𝑤 → 𝑧 ⊆ 𝑤)))
9	8	imdistand 570	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → ((𝑤 ∈ 𝑦 ∧ 𝑧 ∈ 𝑤) → (𝑤 ∈ 𝑦 ∧ 𝑧 ⊆ 𝑤)))
10	9	ancomsd 465	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → ((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) → (𝑤 ∈ 𝑦 ∧ 𝑧 ⊆ 𝑤)))
11	10	eximdv 1916	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → (∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦) → ∃𝑤(𝑤 ∈ 𝑦 ∧ 𝑧 ⊆ 𝑤)))
12		eluni 4934	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ∪ 𝑦 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑦))
13		df-rex 3077	. . . . . . . . . . 11 ⊢ (∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ 𝑧 ⊆ 𝑤))
14	11, 12, 13	3imtr4g 296	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → (𝑧 ∈ ∪ 𝑦 → ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))
15	14	ralimdv 3175	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → (∀𝑧 ∈ 𝐴 𝑧 ∈ ∪ 𝑦 → ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))
16	2, 15	biimtrid 242	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑦 ⊆ 𝐴) → (𝐴 ⊆ ∪ 𝑦 → ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))
17	16	imdistanda 571	. . . . . . 7 ⊢ (𝐴 ∈ On → ((𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦) → (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤)))
18	17	anim2d 611	. . . . . 6 ⊢ (𝐴 ∈ On → ((𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦)) → (𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))))
19	18	eximdv 1916	. . . . 5 ⊢ (𝐴 ∈ On → (∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))))
20	19	ss2abdv 4089	. . . 4 ⊢ (𝐴 ∈ On → {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))})
21		intss 4993	. . . 4 ⊢ ({𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))} ⊆ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))})
22	20, 21	syl 17	. . 3 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤))} ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))})
23	1, 22	eqsstrd 4047	. 2 ⊢ (𝐴 ∈ On → (cf‘𝐴) ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))})
24		cff 10317	. . . . . 6 ⊢ cf:On⟶On
25	24	fdmi 6758	. . . . 5 ⊢ dom cf = On
26	25	eleq2i 2836	. . . 4 ⊢ (𝐴 ∈ dom cf ↔ 𝐴 ∈ On)
27		ndmfv 6955	. . . 4 ⊢ (¬ 𝐴 ∈ dom cf → (cf‘𝐴) = ∅)
28	26, 27	sylnbir 331	. . 3 ⊢ (¬ 𝐴 ∈ On → (cf‘𝐴) = ∅)
29		0ss 4423	. . 3 ⊢ ∅ ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))}
30	28, 29	eqsstrdi 4063	. 2 ⊢ (¬ 𝐴 ∈ On → (cf‘𝐴) ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))})
31	23, 30	pm2.61i 182	1 ⊢ (cf‘𝐴) ⊆ ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ ∪ 𝑦))}

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  {cab 2717  ∀wral 3067  ∃wrex 3076   ⊆ wss 3976  ∅c0 4352  ∪ cuni 4931  ∩ cint 4970  dom cdm 5700  Oncon0 6395  ‘cfv 6573  cardccrd 10004  cfccf 10006

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-card 10008  df-cf 10010

This theorem is referenced by:  cflm  10319  cf0  10320