Theorem cflim3 10379

Description: Another expression for the cofinality function. (Contributed by Mario Carneiro, 28-Feb-2013.)

Hypothesis

Ref	Expression
cflim3.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
cflim3	⊢ (Lim 𝐴 → (cf‘𝐴) = ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥))

Distinct variable group:   𝑥,𝐴

Proof of Theorem cflim3

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

Step	Hyp	Ref	Expression
1		limord 6450	. . . 4 ⊢ (Lim 𝐴 → Ord 𝐴)
2		cflim3.1	. . . . 5 ⊢ 𝐴 ∈ V
3	2	elon 6397	. . . 4 ⊢ (𝐴 ∈ On ↔ Ord 𝐴)
4	1, 3	sylibr 237	. . 3 ⊢ (Lim 𝐴 → 𝐴 ∈ On)
5		cfval 10363	. . 3 ⊢ (𝐴 ∈ On → (cf‘𝐴) = ∩ {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))})
6	4, 5	syl 18	. 2 ⊢ (Lim 𝐴 → (cf‘𝐴) = ∩ {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))})
7		fvex 6929	. . . 4 ⊢ (card‘𝑥) ∈ V
8	7	dfiin2 4996	. . 3 ⊢ ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)}
9		df-rex 3091	. . . . . 6 ⊢ (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)))
10		ancom 466	. . . . . . . 8 ⊢ ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}))
11		rabid 3436	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴))
12		velpw 4565	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
13	12	anbi1i 636	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ ∪ 𝑥 = 𝐴))
14		coflim 10378	. . . . . . . . . . . 12 ⊢ ((Lim 𝐴 ∧ 𝑥 ⊆ 𝐴) → (∪ 𝑥 = 𝐴 ↔ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))
15	14	pm5.32da 590	. . . . . . . . . . 11 ⊢ (Lim 𝐴 → ((𝑥 ⊆ 𝐴 ∧ ∪ 𝑥 = 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤)))
16	13, 15	bitrid 286	. . . . . . . . . 10 ⊢ (Lim 𝐴 → ((𝑥 ∈ 𝒫 𝐴 ∧ ∪ 𝑥 = 𝐴) ↔ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤)))
17	11, 16	bitrid 286	. . . . . . . . 9 ⊢ (Lim 𝐴 → (𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ↔ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤)))
18	17	anbi2d 642	. . . . . . . 8 ⊢ (Lim 𝐴 → ((𝑦 = (card‘𝑥) ∧ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))))
19	10, 18	bitrid 286	. . . . . . 7 ⊢ (Lim 𝐴 → ((𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ (𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))))
20	19	exbidv 1956	. . . . . 6 ⊢ (Lim 𝐴 → (∃𝑥(𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} ∧ 𝑦 = (card‘𝑥)) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))))
21	9, 20	bitrid 286	. . . . 5 ⊢ (Lim 𝐴 → (∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥) ↔ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))))
22	21	abbidv 2829	. . . 4 ⊢ (Lim 𝐴 → {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))})
23	22	inteqd 4917	. . 3 ⊢ (Lim 𝐴 → ∩ {𝑦 ∣ ∃𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴}𝑦 = (card‘𝑥)} = ∩ {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))})
24	8, 23	eqtr2id 2811	. 2 ⊢ (Lim 𝐴 → ∩ {𝑦 ∣ ∃𝑥(𝑦 = (card‘𝑥) ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝑥 𝑧 ⊆ 𝑤))} = ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥))
25	6, 24	eqtrd 2798	1 ⊢ (Lim 𝐴 → (cf‘𝐴) = ∩ 𝑥 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ ∪ 𝑥 = 𝐴} (card‘𝑥))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4872  ∩ cint 4912  ∩ ciin 4957  Ord word 6387  Oncon0 6388  Lim wlim 6389  ‘cfv 6566  cardccrd 10053  cfccf 10055

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-ord 6391  df-on 6392  df-lim 6393  df-iota 6520  df-fun 6568  df-fv 6574  df-cf 10059

This theorem is used by:  cflim2  10380  cfss  10382  cfslb  10383