Theorem cfflb 9681

Description: If there is a cofinal map from 𝐵 to 𝐴, then 𝐵 is at least (cf‘𝐴). This theorem and cff1 9680 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 6520	. . . . . . 7 ⊢ (𝑓:𝐵⟶𝐴 → ran 𝑓 ⊆ 𝐴)
2	1	adantr 483	. . . . . 6 ⊢ ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → ran 𝑓 ⊆ 𝐴)
3		ffn 6514	. . . . . . . . . . 11 ⊢ (𝑓:𝐵⟶𝐴 → 𝑓 Fn 𝐵)
4		fnfvelrn 6848	. . . . . . . . . . 11 ⊢ ((𝑓 Fn 𝐵 ∧ 𝑤 ∈ 𝐵) → (𝑓‘𝑤) ∈ ran 𝑓)
5	3, 4	sylan 582	. . . . . . . . . 10 ⊢ ((𝑓:𝐵⟶𝐴 ∧ 𝑤 ∈ 𝐵) → (𝑓‘𝑤) ∈ ran 𝑓)
6		sseq2 3993	. . . . . . . . . . 11 ⊢ (𝑠 = (𝑓‘𝑤) → (𝑧 ⊆ 𝑠 ↔ 𝑧 ⊆ (𝑓‘𝑤)))
7	6	rspcev 3623	. . . . . . . . . 10 ⊢ (((𝑓‘𝑤) ∈ ran 𝑓 ∧ 𝑧 ⊆ (𝑓‘𝑤)) → ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)
8	5, 7	sylan 582	. . . . . . . . 9 ⊢ (((𝑓:𝐵⟶𝐴 ∧ 𝑤 ∈ 𝐵) ∧ 𝑧 ⊆ (𝑓‘𝑤)) → ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)
9	8	rexlimdva2 3287	. . . . . . . 8 ⊢ (𝑓:𝐵⟶𝐴 → (∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤) → ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
10	9	ralimdv 3178	. . . . . . 7 ⊢ (𝑓:𝐵⟶𝐴 → (∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤) → ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
11	10	imp 409	. . . . . 6 ⊢ ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)
12	2, 11	jca 514	. . . . 5 ⊢ ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
13		fvex 6683	. . . . . 6 ⊢ (card‘ran 𝑓) ∈ V
14		cfval 9669	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
15	14	adantr 483	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
16	15	3ad2ant2 1130	. . . . . . . . 9 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) = ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
17		vex 3497	. . . . . . . . . . . . . 14 ⊢ 𝑓 ∈ V
18	17	rnex 7617	. . . . . . . . . . . . 13 ⊢ ran 𝑓 ∈ V
19		fveq2 6670	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ran 𝑓 → (card‘𝑦) = (card‘ran 𝑓))
20	19	eqeq2d 2832	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ran 𝑓 → (𝑥 = (card‘𝑦) ↔ 𝑥 = (card‘ran 𝑓)))
21		sseq1 3992	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ran 𝑓 → (𝑦 ⊆ 𝐴 ↔ ran 𝑓 ⊆ 𝐴))
22		rexeq 3406	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ran 𝑓 → (∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠 ↔ ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠))
23	22	ralbidv 3197	. . . . . . . . . . . . . . 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 3607	. . . . . . . . . . . 12 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠)))
27		abid 2803	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ↔ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠)))
28	26, 27	sylibr 236	. . . . . . . . . . 11 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → 𝑥 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))})
29		intss1 4891	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ⊆ 𝑥)
30	28, 29	syl 17	. . . . . . . . . 10 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ⊆ 𝑥)
31	30	3adant2 1127	. . . . . . . . 9 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → ∩ {𝑥 ∣ ∃𝑦(𝑥 = (card‘𝑦) ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ 𝑦 𝑧 ⊆ 𝑠))} ⊆ 𝑥)
32	16, 31	eqsstrd 4005	. . . . . . . 8 ⊢ ((𝑥 = (card‘ran 𝑓) ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ 𝑥)
33	32	3expib 1118	. . . . . . 7 ⊢ (𝑥 = (card‘ran 𝑓) → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ 𝑥))
34		sseq2 3993	. . . . . . 7 ⊢ (𝑥 = (card‘ran 𝑓) → ((cf‘𝐴) ⊆ 𝑥 ↔ (cf‘𝐴) ⊆ (card‘ran 𝑓)))
35	33, 34	sylibd 241	. . . . . 6 ⊢ (𝑥 = (card‘ran 𝑓) → (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ (card‘ran 𝑓)))
36	13, 35	vtocle 3584	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (ran 𝑓 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑠 ∈ ran 𝑓 𝑧 ⊆ 𝑠)) → (cf‘𝐴) ⊆ (card‘ran 𝑓))
37	12, 36	sylan2 594	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤))) → (cf‘𝐴) ⊆ (card‘ran 𝑓))
38		cardidm 9388	. . . . . . 7 ⊢ (card‘(card‘ran 𝑓)) = (card‘ran 𝑓)
39		onss 7505	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
40	1, 39	sylan9ssr 3981	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ⊆ On)
41	40	3adant2 1127	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ⊆ On)
42		onssnum 9466	. . . . . . . . . . . 12 ⊢ ((ran 𝑓 ∈ V ∧ ran 𝑓 ⊆ On) → ran 𝑓 ∈ dom card)
43	18, 41, 42	sylancr 589	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ∈ dom card)
44		cardid2 9382	. . . . . . . . . . 11 ⊢ (ran 𝑓 ∈ dom card → (card‘ran 𝑓) ≈ ran 𝑓)
45	43, 44	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ≈ ran 𝑓)
46		onenon 9378	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ On → 𝐵 ∈ dom card)
47		dffn4 6596	. . . . . . . . . . . . . 14 ⊢ (𝑓 Fn 𝐵 ↔ 𝑓:𝐵–onto→ran 𝑓)
48	3, 47	sylib 220	. . . . . . . . . . . . 13 ⊢ (𝑓:𝐵⟶𝐴 → 𝑓:𝐵–onto→ran 𝑓)
49		fodomnum 9483	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ dom card → (𝑓:𝐵–onto→ran 𝑓 → ran 𝑓 ≼ 𝐵))
50	46, 48, 49	syl2im 40	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ On → (𝑓:𝐵⟶𝐴 → ran 𝑓 ≼ 𝐵))
51	50	imp 409	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ≼ 𝐵)
52	51	3adant1 1126	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ran 𝑓 ≼ 𝐵)
53		endomtr 8567	. . . . . . . . . 10 ⊢ (((card‘ran 𝑓) ≈ ran 𝑓 ∧ ran 𝑓 ≼ 𝐵) → (card‘ran 𝑓) ≼ 𝐵)
54	45, 52, 53	syl2anc 586	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ≼ 𝐵)
55		cardon 9373	. . . . . . . . . . . 12 ⊢ (card‘ran 𝑓) ∈ On
56		onenon 9378	. . . . . . . . . . . 12 ⊢ ((card‘ran 𝑓) ∈ On → (card‘ran 𝑓) ∈ dom card)
57	55, 56	ax-mp 5	. . . . . . . . . . 11 ⊢ (card‘ran 𝑓) ∈ dom card
58		carddom2 9406	. . . . . . . . . . 11 ⊢ (((card‘ran 𝑓) ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘(card‘ran 𝑓)) ⊆ (card‘𝐵) ↔ (card‘ran 𝑓) ≼ 𝐵))
59	57, 46, 58	sylancr 589	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → ((card‘(card‘ran 𝑓)) ⊆ (card‘𝐵) ↔ (card‘ran 𝑓) ≼ 𝐵))
60	59	3ad2ant2 1130	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → ((card‘(card‘ran 𝑓)) ⊆ (card‘𝐵) ↔ (card‘ran 𝑓) ≼ 𝐵))
61	54, 60	mpbird 259	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘(card‘ran 𝑓)) ⊆ (card‘𝐵))
62		cardonle 9386	. . . . . . . . 9 ⊢ (𝐵 ∈ On → (card‘𝐵) ⊆ 𝐵)
63	62	3ad2ant2 1130	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘𝐵) ⊆ 𝐵)
64	61, 63	sstrd 3977	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘(card‘ran 𝑓)) ⊆ 𝐵)
65	38, 64	eqsstrrid 4016	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ⊆ 𝐵)
66	65	3expa 1114	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑓:𝐵⟶𝐴) → (card‘ran 𝑓) ⊆ 𝐵)
67	66	adantrr 715	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤))) → (card‘ran 𝑓) ⊆ 𝐵)
68	37, 67	sstrd 3977	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤))) → (cf‘𝐴) ⊆ 𝐵)
69	68	ex 415	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (cf‘𝐴) ⊆ 𝐵))
70	69	exlimdv 1934	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑓(𝑓:𝐵⟶𝐴 ∧ ∀𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑧 ⊆ (𝑓‘𝑤)) → (cf‘𝐴) ⊆ 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537  ∃wex 1780   ∈ wcel 2114  {cab 2799  ∀wral 3138  ∃wrex 3139  Vcvv 3494   ⊆ wss 3936  ∩ cint 4876   class class class wbr 5066  dom cdm 5555  ran crn 5556  Oncon0 6191   Fn wfn 6350  ⟶wf 6351  –onto→wfo 6353  ‘cfv 6355   ≈ cen 8506   ≼ cdom 8507  cardccrd 9364  cfccf 9366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-er 8289  df-map 8408  df-en 8510  df-dom 8511  df-sdom 8512  df-card 9368  df-cf 9370  df-acn 9371

This theorem is referenced by:  cfsmolem  9692  cfcoflem  9694  cfcof  9696  inar1  10197