Theorem tfrlemisucaccv 6215

Description: We can extend an acceptable function by one element to produce an acceptable function. Lemma for tfrlemi1 6222. (Contributed by Jim Kingdon, 4-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)

Hypotheses

Ref	Expression
tfrlemisucfn.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
tfrlemisucfn.2	⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
tfrlemisucfn.3	⊢ (𝜑 → 𝑧 ∈ On)
tfrlemisucfn.4	⊢ (𝜑 → 𝑔 Fn 𝑧)
tfrlemisucfn.5	⊢ (𝜑 → 𝑔 ∈ 𝐴)

Assertion

Ref	Expression
tfrlemisucaccv	⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐴)

Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝑧,𝐴   𝑓,𝐹,𝑔,𝑥,𝑦,𝑧   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑧,𝑓,𝑔)

Proof of Theorem tfrlemisucaccv

Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfrlemisucfn.3	. . . 4 ⊢ (𝜑 → 𝑧 ∈ On)
2		suceloni 4412	. . . 4 ⊢ (𝑧 ∈ On → suc 𝑧 ∈ On)
3	1, 2	syl 14	. . 3 ⊢ (𝜑 → suc 𝑧 ∈ On)
4		tfrlemisucfn.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
5		tfrlemisucfn.2	. . . 4 ⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
6		tfrlemisucfn.4	. . . 4 ⊢ (𝜑 → 𝑔 Fn 𝑧)
7		tfrlemisucfn.5	. . . 4 ⊢ (𝜑 → 𝑔 ∈ 𝐴)
8	4, 5, 1, 6, 7	tfrlemisucfn 6214	. . 3 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn suc 𝑧)
9		vex 2684	. . . . . 6 ⊢ 𝑢 ∈ V
10	9	elsuc 4323	. . . . 5 ⊢ (𝑢 ∈ suc 𝑧 ↔ (𝑢 ∈ 𝑧 ∨ 𝑢 = 𝑧))
11		vex 2684	. . . . . . . . . . 11 ⊢ 𝑔 ∈ V
12	4, 11	tfrlem3a 6200	. . . . . . . . . 10 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑣 ∈ On (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
13	7, 12	sylib 121	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑣 ∈ On (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
14		simprrr 529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))) → ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))
15		simprrl 528	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))) → 𝑔 Fn 𝑣)
16	6	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))) → 𝑔 Fn 𝑧)
17		fndmu 5219	. . . . . . . . . . . 12 ⊢ ((𝑔 Fn 𝑣 ∧ 𝑔 Fn 𝑧) → 𝑣 = 𝑧)
18	15, 16, 17	syl2anc 408	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))) → 𝑣 = 𝑧)
19	18	raleqdv 2630	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))) → (∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)) ↔ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))
20	14, 19	mpbid 146	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢))))) → ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))
21	13, 20	rexlimddv 2552	. . . . . . . 8 ⊢ (𝜑 → ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))
22	21	r19.21bi 2518	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (𝑔‘𝑢) = (𝐹‘(𝑔 ↾ 𝑢)))
23		elirrv 4458	. . . . . . . . . . 11 ⊢ ¬ 𝑢 ∈ 𝑢
24		elequ2 1691	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑢 → (𝑢 ∈ 𝑧 ↔ 𝑢 ∈ 𝑢))
25	23, 24	mtbiri 664	. . . . . . . . . 10 ⊢ (𝑧 = 𝑢 → ¬ 𝑢 ∈ 𝑧)
26	25	necon2ai 2360	. . . . . . . . 9 ⊢ (𝑢 ∈ 𝑧 → 𝑧 ≠ 𝑢)
27	26	adantl 275	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → 𝑧 ≠ 𝑢)
28		fvunsng 5607	. . . . . . . 8 ⊢ ((𝑢 ∈ V ∧ 𝑧 ≠ 𝑢) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝑔‘𝑢))
29	9, 27, 28	sylancr 410	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝑔‘𝑢))
30		eloni 4292	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ On → Ord 𝑧)
31	1, 30	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → Ord 𝑧)
32		ordelss 4296	. . . . . . . . . . 11 ⊢ ((Ord 𝑧 ∧ 𝑢 ∈ 𝑧) → 𝑢 ⊆ 𝑧)
33	31, 32	sylan 281	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → 𝑢 ⊆ 𝑧)
34		resabs1 4843	. . . . . . . . . 10 ⊢ (𝑢 ⊆ 𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢))
35	33, 34	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢))
36		elirrv 4458	. . . . . . . . . . . 12 ⊢ ¬ 𝑧 ∈ 𝑧
37		fsnunres 5615	. . . . . . . . . . . 12 ⊢ ((𝑔 Fn 𝑧 ∧ ¬ 𝑧 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧) = 𝑔)
38	6, 36, 37	sylancl 409	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧) = 𝑔)
39	38	reseq1d 4813	. . . . . . . . . 10 ⊢ (𝜑 → (((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔 ↾ 𝑢))
40	39	adantr 274	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔 ↾ 𝑢))
41	35, 40	eqtr3d 2172	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢) = (𝑔 ↾ 𝑢))
42	41	fveq2d 5418	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)) = (𝐹‘(𝑔 ↾ 𝑢)))
43	22, 29, 42	3eqtr4d 2180	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))
44	5	tfrlem3-2d 6202	. . . . . . . . . 10 ⊢ (𝜑 → (Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))
45	44	simprd 113	. . . . . . . . 9 ⊢ (𝜑 → (𝐹‘𝑔) ∈ V)
46		fndm 5217	. . . . . . . . . . . 12 ⊢ (𝑔 Fn 𝑧 → dom 𝑔 = 𝑧)
47	6, 46	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝑔 = 𝑧)
48	47	eleq2d 2207	. . . . . . . . . 10 ⊢ (𝜑 → (𝑧 ∈ dom 𝑔 ↔ 𝑧 ∈ 𝑧))
49	36, 48	mtbiri 664	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑧 ∈ dom 𝑔)
50		fsnunfv 5614	. . . . . . . . 9 ⊢ ((𝑧 ∈ On ∧ (𝐹‘𝑔) ∈ V ∧ ¬ 𝑧 ∈ dom 𝑔) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑧) = (𝐹‘𝑔))
51	1, 45, 49, 50	syl3anc 1216	. . . . . . . 8 ⊢ (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑧) = (𝐹‘𝑔))
52	51	adantr 274	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑧) = (𝐹‘𝑔))
53		simpr 109	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → 𝑢 = 𝑧)
54	53	fveq2d 5418	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑧))
55		reseq2 4809	. . . . . . . . 9 ⊢ (𝑢 = 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑧))
56	55, 38	sylan9eqr 2192	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢) = 𝑔)
57	56	fveq2d 5418	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)) = (𝐹‘𝑔))
58	52, 54, 57	3eqtr4d 2180	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))
59	43, 58	jaodan 786	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝑧 ∨ 𝑢 = 𝑧)) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))
60	10, 59	sylan2b 285	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ suc 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))
61	60	ralrimiva 2503	. . 3 ⊢ (𝜑 → ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))
62		fneq2 5207	. . . . 5 ⊢ (𝑤 = suc 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn 𝑤 ↔ (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn suc 𝑧))
63		raleq 2624	. . . . 5 ⊢ (𝑤 = suc 𝑧 → (∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)) ↔ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢))))
64	62, 63	anbi12d 464	. . . 4 ⊢ (𝑤 = suc 𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢))) ↔ ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))))
65	64	rspcev 2784	. . 3 ⊢ ((suc 𝑧 ∈ On ∧ ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))) → ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢))))
66	3, 8, 61, 65	syl12anc 1214	. 2 ⊢ (𝜑 → ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢))))
67		vex 2684	. . . . . 6 ⊢ 𝑧 ∈ V
68		opexg 4145	. . . . . 6 ⊢ ((𝑧 ∈ V ∧ (𝐹‘𝑔) ∈ V) → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ V)
69	67, 45, 68	sylancr 410	. . . . 5 ⊢ (𝜑 → ⟨𝑧, (𝐹‘𝑔)⟩ ∈ V)
70		snexg 4103	. . . . 5 ⊢ (⟨𝑧, (𝐹‘𝑔)⟩ ∈ V → {⟨𝑧, (𝐹‘𝑔)⟩} ∈ V)
71	69, 70	syl 14	. . . 4 ⊢ (𝜑 → {⟨𝑧, (𝐹‘𝑔)⟩} ∈ V)
72		unexg 4359	. . . 4 ⊢ ((𝑔 ∈ V ∧ {⟨𝑧, (𝐹‘𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V)
73	11, 71, 72	sylancr 410	. . 3 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V)
74	4	tfrlem3ag 6199	. . 3 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ V → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))))
75	73, 74	syl 14	. 2 ⊢ (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ↾ 𝑢)))))
76	66, 75	mpbird 166	1 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}) ∈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697  ∀wal 1329   = wceq 1331   ∈ wcel 1480  {cab 2123   ≠ wne 2306  ∀wral 2414  ∃wrex 2415  Vcvv 2681   ∪ cun 3064   ⊆ wss 3066  {csn 3522  ⟨cop 3525  Ord word 4279  Oncon0 4280  suc csuc 4282  dom cdm 4534   ↾ cres 4536  Fun wfun 5112   Fn wfn 5113  ‘cfv 5118

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-suc 4288  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-res 4546  df-iota 5083  df-fun 5120  df-fn 5121  df-fv 5126

This theorem is referenced by:  tfrlemibacc  6216  tfrlemi14d  6223