Theorem cfflb 10219

Description: If there is a cofinal map from 𝐵 to 𝐴, then 𝐵 is at least (cf‘𝐴). This theorem and cff1 10218 motivate the picture of (cf‘𝐴) as the greatest lower bound of the domain of cofinal maps into 𝐴. (Contributed by Mario Carneiro, 28-Feb-2013.)

Assertion

Ref	Expression
cfflb	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑓(𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (cf‘𝐴) ⊆ 𝐵))

Distinct variable groups:   𝐴,𝑓,𝑤,𝑧   𝐵,𝑓,𝑤,𝑧

Proof of Theorem cfflb

Dummy variables 𝑠 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frn 6698	. . . . . . 7 ⊢ (𝑓:𝐵⟶𝐴 → ran 𝑓 ⊆ 𝐴)
2	1	adantr 480	. . . . . 6 ⊢ ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → ran 𝑓 ⊆ 𝐴)
3		ffn 6691	. . . . . . . . . . 11 ⊢ (𝑓:𝐵⟶𝐴 → 𝑓 Fn 𝐵)
4		fnfvelrn 7055	. . . . . . . . . . 11 ⊢ ((𝑓 Fn 𝐵 ∧ 𝑤 ∈ 𝐵) → (𝑓‘𝑤) ∈ ran 𝑓)
5	3, 4	sylan 580	. . . . . . . . . 10 ⊢ ((𝑓:𝐵⟶𝐴 ∧ 𝑤 ∈ 𝐵) → (𝑓‘𝑤) ∈ ran 𝑓)
6		sseq2 3976	. . . . . . . . . . 11 ⊢ (𝑠 = (𝑓‘𝑤) → (𝑧 ⊆ 𝑠 ↔ 𝑧 ⊆ (𝑓‘𝑤)))
7	6	rspcev 3591	. . . . . . . . . 10 ⊢ (((𝑓‘𝑤) ∈ ran 𝑓 ∧ 𝑧 ⊆ (𝑓‘𝑤)) → ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)
8	5, 7	sylan 580	. . . . . . . . 9 ⊢ (((𝑓:𝐵⟶𝐴 ∧ 𝑤 ∈ 𝐵) ∧ 𝑧 ⊆ (𝑓‘𝑤)) → ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)
9	8	rexlimdva2 3137	. . . . . . . 8 ⊢ (𝑓:𝐵⟶𝐴 → (∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤) → ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
10	9	ralimdv 3148	. . . . . . 7 ⊢ (𝑓:𝐵⟶𝐴 → (∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤) → ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
11	10	imp 406	. . . . . 6 ⊢ ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)
12	2, 11	jca 511	. . . . 5 ⊢ ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
13		fvex 6874	. . . . . 6 ⊢ (card‘ran 𝑓) ∈ V
14		cfval 10207	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
15	14	adantr 480	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
16	15	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
17		vex 3454	. . . . . . . . . . . . . 14 ⊢ 𝑓 ∈ V
18	17	rnex 7889	. . . . . . . . . . . . 13 ⊢ ran 𝑓 ∈ V
19		fveq2 6861	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ran 𝑓 → (card‘𝑦) = (card‘ran 𝑓))
20	19	eqeq2d 2741	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ran 𝑓 → (𝑥 = (card‘𝑦) ↔ 𝑥 = (card‘ran 𝑓)))
21		sseq1 3975	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ran 𝑓 → (𝑦 ⊆ 𝐴 ↔ ran 𝑓 ⊆ 𝐴))
22		rexeq 3297	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ran 𝑓 → (∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠 ↔ ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
23	22	ralbidv 3157	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ran 𝑓 → (∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠 ↔ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
24	21, 23	anbi12d 632	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ran 𝑓 → ((𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠) ↔ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)))
25	20, 24	anbi12d 632	. . . . . . . . . . . . 13 ⊢ (𝑦 = ran 𝑓 → ((𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠)) ↔ (𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))))
26	18, 25	spcev 3575	. . . . . . . . . . . 12 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠)))
27		abid 2712	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ↔ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠)))
28	26, 27	sylibr 234	. . . . . . . . . . 11 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → 𝑥 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
29		intss1 4930	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ⊆ 𝑥)
30	28, 29	syl 17	. . . . . . . . . 10 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ⊆ 𝑥)
31	30	3adant2 1131	. . . . . . . . 9 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ⊆ 𝑥)
32	16, 31	eqsstrd 3984	. . . . . . . 8 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ 𝑥)
33	32	3expib 1122	. . . . . . 7 ⊢ (𝑥 = (card‘ran 𝑓) → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ 𝑥))
34		sseq2 3976	. . . . . . 7 ⊢ (𝑥 = (card‘ran 𝑓) → ((cf‘𝐴) ⊆ 𝑥 ↔ (cf‘𝐴) ⊆ (card‘ran 𝑓)))
35	33, 34	sylibd 239	. . . . . 6 ⊢ (𝑥 = (card‘ran 𝑓) → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ (card‘ran 𝑓)))
36	13, 35	vtocle 3524	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ (card‘ran 𝑓))
37	12, 36	sylan2 593	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤))) → (cf‘𝐴) ⊆ (card‘ran 𝑓))
38		cardidm 9919	. . . . . . 7 ⊢ (card‘(card‘ran 𝑓)) = (card‘ran 𝑓)
39		onss 7764	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
40	1, 39	sylan9ssr 3964	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ⊆ On)
41	40	3adant2 1131	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ⊆ On)
42		onssnum 10000	. . . . . . . . . . . 12 ⊢ ((ran 𝑓 ∈ V ∧ ran 𝑓 ⊆ On) → ran 𝑓 ∈ dom card)
43	18, 41, 42	sylancr 587	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ∈ dom card)
44		cardid2 9913	. . . . . . . . . . 11 ⊢ (ran 𝑓 ∈ dom card → (card‘ran 𝑓) ≈ ran 𝑓)
45	43, 44	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ≈ ran 𝑓)
46		onenon 9909	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ On → 𝐵 ∈ dom card)
47		dffn4 6781	. . . . . . . . . . . . . 14 ⊢ (𝑓 Fn 𝐵 ↔ 𝑓:𝐵–onto→ran 𝑓)
48	3, 47	sylib 218	. . . . . . . . . . . . 13 ⊢ (𝑓:𝐵⟶𝐴 → 𝑓:𝐵–onto→ran 𝑓)
49		fodomnum 10017	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ dom card → (𝑓:𝐵–onto→ran 𝑓 → ran 𝑓 ≼ 𝐵))
50	46, 48, 49	syl2im 40	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ On → (𝑓:𝐵⟶𝐴 → ran 𝑓 ≼ 𝐵))
51	50	imp 406	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ≼ 𝐵)
52	51	3adant1 1130	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ≼ 𝐵)
53		endomtr 8986	. . . . . . . . . 10 ⊢ (((card‘ran 𝑓) ≈ ran 𝑓 ∧ ran 𝑓 ≼ 𝐵) → (card‘ran 𝑓) ≼ 𝐵)
54	45, 52, 53	syl2anc 584	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ≼ 𝐵)
55		cardon 9904	. . . . . . . . . . . 12 ⊢ (card‘ran 𝑓) ∈ On
56		onenon 9909	. . . . . . . . . . . 12 ⊢ ((card‘ran 𝑓) ∈ On → (card‘ran 𝑓) ∈ dom card)
57	55, 56	ax-mp 5	. . . . . . . . . . 11 ⊢ (card‘ran 𝑓) ∈ dom card
58		carddom2 9937	. . . . . . . . . . 11 ⊢ (((card‘ran 𝑓) ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘(card‘ran 𝑓)) ⊆ (card‘𝐵) ↔ (card‘ran 𝑓) ≼ 𝐵))
59	57, 46, 58	sylancr 587	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → ((card‘(card‘ran 𝑓)) ⊆ (card‘𝐵) ↔ (card‘ran 𝑓) ≼ 𝐵))
60	59	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ((card‘(card‘ran 𝑓)) ⊆ (card‘𝐵) ↔ (card‘ran 𝑓) ≼ 𝐵))
61	54, 60	mpbird 257	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘(card‘ran 𝑓)) ⊆ (card‘𝐵))
62		cardonle 9917	. . . . . . . . 9 ⊢ (𝐵 ∈ On → (card‘𝐵) ⊆ 𝐵)
63	62	3ad2ant2 1134	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘𝐵) ⊆ 𝐵)
64	61, 63	sstrd 3960	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘(card‘ran 𝑓)) ⊆ 𝐵)
65	38, 64	eqsstrrid 3989	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ⊆ 𝐵)
66	65	3expa 1118	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ⊆ 𝐵)
67	66	adantrr 717	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤))) → (card‘ran 𝑓) ⊆ 𝐵)
68	37, 67	sstrd 3960	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤))) → (cf‘𝐴) ⊆ 𝐵)
69	68	ex 412	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (cf‘𝐴) ⊆ 𝐵))
70	69	exlimdv 1933	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑓(𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (cf‘𝐴) ⊆ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2708  ∀wral 3045  ∃wrex 3054  Vcvv 3450   ⊆ wss 3917  ∩ cint 4913   class class class wbr 5110  dom cdm 5641  ran crn 5642  Oncon0 6335   Fn wfn 6509  ⟶wf 6510  –onto→wfo 6512  ‘cfv 6514   ≈ cen 8918   ≼ cdom 8919  cardccrd 9895  cfccf 9897

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-rep 5237  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-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  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-iun 4960  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-se 5595  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-pred 6277  df-ord 6338  df-on 6339  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-isom 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-er 8674  df-map 8804  df-en 8922  df-dom 8923  df-sdom 8924  df-card 9899  df-cf 9901  df-acn 9902

This theorem is referenced by:  cfsmolem  10230  cfcoflem  10232  cfcof  10234  inar1  10735