Theorem tfr1onlemsucaccv 6285

Description: Lemma for tfr1on 6294. We can extend an acceptable function by one element to produce an acceptable function. (Contributed by Jim Kingdon, 12-Mar-2022.)

Hypotheses

Ref	Expression
tfr1on.f	⊢ 𝐹 = recs(𝐺)
tfr1on.g	⊢ (𝜑 → Fun 𝐺)
tfr1on.x	⊢ (𝜑 → Ord 𝑋)
tfr1on.ex	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
tfr1onlemsucfn.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
tfr1onlemsucaccv.yx	⊢ (𝜑 → 𝑌 ∈ 𝑋)
tfr1onlemsucaccv.zy	⊢ (𝜑 → 𝑧 ∈ 𝑌)
tfr1onlemsucaccv.u	⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
tfr1onlemsucaccv.gfn	⊢ (𝜑 → 𝑔 Fn 𝑧)
tfr1onlemsucaccv.gacc	⊢ (𝜑 → 𝑔 ∈ 𝐴)

Assertion

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

Distinct variable groups:   𝑓,𝐺,𝑥,𝑦   𝑓,𝑋,𝑥   𝑓,𝑔,𝑥,𝑦   𝜑,𝑓,𝑥   𝑧,𝑓,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑦,𝑧,𝑔)   𝐴(𝑥,𝑦,𝑧,𝑓,𝑔)   𝐹(𝑥,𝑦,𝑧,𝑓,𝑔)   𝐺(𝑧,𝑔)   𝑋(𝑦,𝑧,𝑔)   𝑌(𝑥,𝑦,𝑧,𝑓,𝑔)

Proof of Theorem tfr1onlemsucaccv

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

Step	Hyp	Ref	Expression
1		suceq 4362	. . . . 5 ⊢ (𝑥 = 𝑧 → suc 𝑥 = suc 𝑧)
2	1	eleq1d 2226	. . . 4 ⊢ (𝑥 = 𝑧 → (suc 𝑥 ∈ 𝑋 ↔ suc 𝑧 ∈ 𝑋))
3		tfr1onlemsucaccv.u	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
4	3	ralrimiva 2530	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ∪ 𝑋 suc 𝑥 ∈ 𝑋)
5		tfr1onlemsucaccv.zy	. . . . 5 ⊢ (𝜑 → 𝑧 ∈ 𝑌)
6		tfr1onlemsucaccv.yx	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑋)
7		elunii 3777	. . . . 5 ⊢ ((𝑧 ∈ 𝑌 ∧ 𝑌 ∈ 𝑋) → 𝑧 ∈ ∪ 𝑋)
8	5, 6, 7	syl2anc 409	. . . 4 ⊢ (𝜑 → 𝑧 ∈ ∪ 𝑋)
9	2, 4, 8	rspcdva 2821	. . 3 ⊢ (𝜑 → suc 𝑧 ∈ 𝑋)
10		tfr1on.f	. . . 4 ⊢ 𝐹 = recs(𝐺)
11		tfr1on.g	. . . 4 ⊢ (𝜑 → Fun 𝐺)
12		tfr1on.x	. . . 4 ⊢ (𝜑 → Ord 𝑋)
13		tfr1on.ex	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
14		tfr1onlemsucfn.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
15	5, 6	jca 304	. . . . 5 ⊢ (𝜑 → (𝑧 ∈ 𝑌 ∧ 𝑌 ∈ 𝑋))
16		ordtr1 4348	. . . . 5 ⊢ (Ord 𝑋 → ((𝑧 ∈ 𝑌 ∧ 𝑌 ∈ 𝑋) → 𝑧 ∈ 𝑋))
17	12, 15, 16	sylc 62	. . . 4 ⊢ (𝜑 → 𝑧 ∈ 𝑋)
18		tfr1onlemsucaccv.gfn	. . . 4 ⊢ (𝜑 → 𝑔 Fn 𝑧)
19		tfr1onlemsucaccv.gacc	. . . 4 ⊢ (𝜑 → 𝑔 ∈ 𝐴)
20	10, 11, 12, 13, 14, 17, 18, 19	tfr1onlemsucfn 6284	. . 3 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧)
21		vex 2715	. . . . . 6 ⊢ 𝑢 ∈ V
22	21	elsuc 4366	. . . . 5 ⊢ (𝑢 ∈ suc 𝑧 ↔ (𝑢 ∈ 𝑧 ∨ 𝑢 = 𝑧))
23		vex 2715	. . . . . . . . . . 11 ⊢ 𝑔 ∈ V
24	14	tfr1onlem3ag 6281	. . . . . . . . . . 11 ⊢ (𝑔 ∈ V → (𝑔 ∈ 𝐴 ↔ ∃𝑣 ∈ 𝑋 (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))))
25	23, 24	ax-mp 5	. . . . . . . . . 10 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑣 ∈ 𝑋 (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))
26	19, 25	sylib 121	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑣 ∈ 𝑋 (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))
27		simprrr 530	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝑋 ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))) → ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))
28		simprrl 529	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝑋 ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))) → 𝑔 Fn 𝑣)
29	18	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝑋 ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))) → 𝑔 Fn 𝑧)
30		fndmu 5270	. . . . . . . . . . . 12 ⊢ ((𝑔 Fn 𝑣 ∧ 𝑔 Fn 𝑧) → 𝑣 = 𝑧)
31	28, 29, 30	syl2anc 409	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝑋 ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))) → 𝑣 = 𝑧)
32	31	raleqdv 2658	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝑋 ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))) → (∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)) ↔ ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))
33	27, 32	mpbid 146	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝑋 ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢 ∈ 𝑣 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢))))) → ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))
34	26, 33	rexlimddv 2579	. . . . . . . 8 ⊢ (𝜑 → ∀𝑢 ∈ 𝑧 (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))
35	34	r19.21bi 2545	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (𝑔‘𝑢) = (𝐺‘(𝑔 ↾ 𝑢)))
36		ordelon 4343	. . . . . . . . . . . . 13 ⊢ ((Ord 𝑋 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ On)
37	12, 17, 36	syl2anc 409	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑧 ∈ On)
38		onelon 4344	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ On ∧ 𝑢 ∈ 𝑧) → 𝑢 ∈ On)
39	37, 38	sylan 281	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → 𝑢 ∈ On)
40		eloni 4335	. . . . . . . . . . 11 ⊢ (𝑢 ∈ On → Ord 𝑢)
41		ordirr 4500	. . . . . . . . . . 11 ⊢ (Ord 𝑢 → ¬ 𝑢 ∈ 𝑢)
42	39, 40, 41	3syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ¬ 𝑢 ∈ 𝑢)
43		elequ2 2133	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑢 → (𝑢 ∈ 𝑧 ↔ 𝑢 ∈ 𝑢))
44	43	biimpcd 158	. . . . . . . . . . 11 ⊢ (𝑢 ∈ 𝑧 → (𝑧 = 𝑢 → 𝑢 ∈ 𝑢))
45	44	adantl 275	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (𝑧 = 𝑢 → 𝑢 ∈ 𝑢))
46	42, 45	mtod 653	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ¬ 𝑧 = 𝑢)
47	46	neqned 2334	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → 𝑧 ≠ 𝑢)
48		fvunsng 5660	. . . . . . . 8 ⊢ ((𝑢 ∈ V ∧ 𝑧 ≠ 𝑢) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝑔‘𝑢))
49	21, 47, 48	sylancr 411	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝑔‘𝑢))
50		eloni 4335	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ On → Ord 𝑧)
51	37, 50	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → Ord 𝑧)
52		ordelss 4339	. . . . . . . . . . 11 ⊢ ((Ord 𝑧 ∧ 𝑢 ∈ 𝑧) → 𝑢 ⊆ 𝑧)
53	51, 52	sylan 281	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → 𝑢 ⊆ 𝑧)
54		resabs1 4894	. . . . . . . . . 10 ⊢ (𝑢 ⊆ 𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢))
55	53, 54	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢))
56		ordirr 4500	. . . . . . . . . . . . 13 ⊢ (Ord 𝑧 → ¬ 𝑧 ∈ 𝑧)
57	51, 56	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝑧)
58		fsnunres 5668	. . . . . . . . . . . 12 ⊢ ((𝑔 Fn 𝑧 ∧ ¬ 𝑧 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧) = 𝑔)
59	18, 57, 58	syl2anc 409	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧) = 𝑔)
60	59	reseq1d 4864	. . . . . . . . . 10 ⊢ (𝜑 → (((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔 ↾ 𝑢))
61	60	adantr 274	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔 ↾ 𝑢))
62	55, 61	eqtr3d 2192	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢) = (𝑔 ↾ 𝑢))
63	62	fveq2d 5471	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)) = (𝐺‘(𝑔 ↾ 𝑢)))
64	35, 49, 63	3eqtr4d 2200	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))
65		fneq2 5258	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → (𝑓 Fn 𝑥 ↔ 𝑓 Fn 𝑧))
66	65	imbi1d 230	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → ((𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ (𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
67	66	albidv 1804	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
68	13	3expia 1187	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
69	68	alrimiv 1854	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
70	69	ralrimiva 2530	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
71	67, 70, 17	rspcdva 2821	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V))
72		fneq1 5257	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝑧 ↔ 𝑔 Fn 𝑧))
73		fveq2 5467	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔))
74	73	eleq1d 2226	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ V ↔ (𝐺‘𝑔) ∈ V))
75	72, 74	imbi12d 233	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) ↔ (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V)))
76	75	spv 1840	. . . . . . . . . 10 ⊢ (∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) → (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V))
77	71, 18, 76	sylc 62	. . . . . . . . 9 ⊢ (𝜑 → (𝐺‘𝑔) ∈ V)
78		fndm 5268	. . . . . . . . . . 11 ⊢ (𝑔 Fn 𝑧 → dom 𝑔 = 𝑧)
79	18, 78	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝑔 = 𝑧)
80	57, 79	neleqtrrd 2256	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑧 ∈ dom 𝑔)
81		fsnunfv 5667	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑌 ∧ (𝐺‘𝑔) ∈ V ∧ ¬ 𝑧 ∈ dom 𝑔) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑧) = (𝐺‘𝑔))
82	5, 77, 80, 81	syl3anc 1220	. . . . . . . 8 ⊢ (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑧) = (𝐺‘𝑔))
83	82	adantr 274	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑧) = (𝐺‘𝑔))
84		simpr 109	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → 𝑢 = 𝑧)
85	84	fveq2d 5471	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑧))
86		reseq2 4860	. . . . . . . . 9 ⊢ (𝑢 = 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑧))
87	86, 59	sylan9eqr 2212	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢) = 𝑔)
88	87	fveq2d 5471	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)) = (𝐺‘𝑔))
89	83, 85, 88	3eqtr4d 2200	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))
90	64, 89	jaodan 787	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝑧 ∨ 𝑢 = 𝑧)) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))
91	22, 90	sylan2b 285	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ suc 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))
92	91	ralrimiva 2530	. . 3 ⊢ (𝜑 → ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))
93		fneq2 5258	. . . . 5 ⊢ (𝑤 = suc 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn 𝑤 ↔ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧))
94		raleq 2652	. . . . 5 ⊢ (𝑤 = suc 𝑧 → (∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)) ↔ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢))))
95	93, 94	anbi12d 465	. . . 4 ⊢ (𝑤 = suc 𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢))) ↔ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))))
96	95	rspcev 2816	. . 3 ⊢ ((suc 𝑧 ∈ 𝑋 ∧ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))) → ∃𝑤 ∈ 𝑋 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢))))
97	9, 20, 92, 96	syl12anc 1218	. 2 ⊢ (𝜑 → ∃𝑤 ∈ 𝑋 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢))))
98		vex 2715	. . . . . 6 ⊢ 𝑧 ∈ V
99		opexg 4188	. . . . . 6 ⊢ ((𝑧 ∈ V ∧ (𝐺‘𝑔) ∈ V) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
100	98, 77, 99	sylancr 411	. . . . 5 ⊢ (𝜑 → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
101		snexg 4145	. . . . 5 ⊢ (⟨𝑧, (𝐺‘𝑔)⟩ ∈ V → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
102	100, 101	syl 14	. . . 4 ⊢ (𝜑 → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
103		unexg 4402	. . . 4 ⊢ ((𝑔 ∈ V ∧ {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
104	23, 102, 103	sylancr 411	. . 3 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
105	14	tfr1onlem3ag 6281	. . 3 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ 𝑋 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))))
106	104, 105	syl 14	. 2 ⊢ (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ 𝑋 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢 ∈ 𝑤 ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})‘𝑢) = (𝐺‘((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ↾ 𝑢)))))
107	97, 106	mpbird 166	1 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698   ∧ w3a 963  ∀wal 1333   = wceq 1335   ∈ wcel 2128  {cab 2143   ≠ wne 2327  ∀wral 2435  ∃wrex 2436  Vcvv 2712   ∪ cun 3100   ⊆ wss 3102  {csn 3560  ⟨cop 3563  ∪ cuni 3772  Ord word 4322  Oncon0 4323  suc csuc 4325  dom cdm 4585   ↾ cres 4587  Fun wfun 5163   Fn wfn 5164  ‘cfv 5169  recscrecs 6248

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 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169  ax-un 4393  ax-setind 4495

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-v 2714  df-sbc 2938  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-opab 4026  df-tr 4063  df-id 4253  df-iord 4326  df-on 4328  df-suc 4331  df-xp 4591  df-rel 4592  df-cnv 4593  df-co 4594  df-dm 4595  df-res 4597  df-iota 5134  df-fun 5171  df-fn 5172  df-fv 5177

This theorem is referenced by:  tfr1onlembacc  6286  tfr1onlemres  6293