Theorem tfrcllembxssdm 6627

Description: Lemma for tfrcl 6635. The union of 𝐵 is defined on all elements of 𝑋. (Contributed by Jim Kingdon, 25-Mar-2022.)

Hypotheses

Ref	Expression
tfrcl.f	⊢ 𝐹 = recs(𝐺)
tfrcl.g	⊢ (𝜑 → Fun 𝐺)
tfrcl.x	⊢ (𝜑 → Ord 𝑋)
tfrcl.ex	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
tfrcllemsucfn.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
tfrcllembacc.3	⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
tfrcllembacc.u	⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
tfrcllembacc.4	⊢ (𝜑 → 𝐷 ∈ 𝑋)
tfrcllembacc.5	⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))

Assertion

Ref	Expression
tfrcllembxssdm	⊢ (𝜑 → 𝐷 ⊆ dom ∪ 𝐵)

Distinct variable groups:   𝐴,𝑓,𝑔,ℎ,𝑥,𝑦,𝑧   𝐷,𝑓,𝑔,𝑥,𝑦   𝑓,𝐺,𝑥,𝑦   𝑆,𝑓,𝑥,𝑦   𝑓,𝑋,𝑥   𝜑,𝑓,𝑔,ℎ,𝑥,𝑦,𝑧   𝐵,𝑔,ℎ,𝑧   𝑤,𝐵,𝑔,𝑧   𝐷,ℎ,𝑧   ℎ,𝐺,𝑧   𝑤,𝐺,𝑦   𝑆,ℎ,𝑧   𝑧,𝑋

Allowed substitution hints:   𝜑(𝑤)   𝐴(𝑤)   𝐵(𝑥, 𝑦, 𝑓)   𝐷(𝑤)   𝑆(𝑤, 𝑔)   𝐹(𝑥, 𝑦, 𝑧, 𝑤, 𝑓, 𝑔, ℎ)   𝐺(𝑔)   𝑋(𝑦, 𝑤, 𝑔, ℎ)

Proof of Theorem tfrcllembxssdm

Step	Hyp	Ref	Expression
1		tfrcllembacc.5	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))
2		fveq2 5695	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝑔‘𝑤) = (𝑔‘𝑦))
3		reseq2 5058	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑔 ↾ 𝑤) = (𝑔 ↾ 𝑦))
4	3	fveq2d 5699	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝐺‘(𝑔 ↾ 𝑤)) = (𝐺‘(𝑔 ↾ 𝑦)))
5	2, 4	eqeq12d 2253	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → ((𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)) ↔ (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
6	5	cbvralv 2786	. . . . . . 7 ⊢ (∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)) ↔ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))
7	6	anbi2i 461	. . . . . 6 ⊢ ((𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))) ↔ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
8	7	exbii 1658	. . . . 5 ⊢ (∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))) ↔ ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
9	8	ralbii 2556	. . . 4 ⊢ (∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))) ↔ ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
10	1, 9	sylib 122	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
11		simp1 1028	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝜑)
12		simp2 1029	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝑧 ∈ 𝐷)
13		tfrcllembacc.4	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
14	11, 13	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝐷 ∈ 𝑋)
15		tfrcl.x	. . . . . . . . . . 11 ⊢ (𝜑 → Ord 𝑋)
16		ordtr1 4533	. . . . . . . . . . 11 ⊢ (Ord 𝑋 → ((𝑧 ∈ 𝐷 ∧ 𝐷 ∈ 𝑋) → 𝑧 ∈ 𝑋))
17	15, 16	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑧 ∈ 𝐷 ∧ 𝐷 ∈ 𝑋) → 𝑧 ∈ 𝑋))
18	17	imp 124	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐷 ∧ 𝐷 ∈ 𝑋)) → 𝑧 ∈ 𝑋)
19	11, 12, 14, 18	syl12anc 1276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝑧 ∈ 𝑋)
20		simp3l 1056	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝑔:𝑧⟶𝑆)
21		feq2 5517	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → (𝑓:𝑥⟶𝑆 ↔ 𝑓:𝑧⟶𝑆))
22	21	imbi1d 231	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → ((𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ (𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)))
23	22	albidv 1877	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ ∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)))
24		tfrcl.ex	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
25	24	3expia 1236	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
26	25	alrimiv 1927	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
27	26	ralrimiva 2623	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
28	27	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
29		simpr 110	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
30	23, 28, 29	rspcdva 2934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → ∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
31		feq1 5516	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑓:𝑧⟶𝑆 ↔ 𝑔:𝑧⟶𝑆))
32		fveq2 5695	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔))
33	32	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ 𝑆 ↔ (𝐺‘𝑔) ∈ 𝑆))
34	31, 33	imbi12d 234	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → ((𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆)))
35	34	spv 1913	. . . . . . . . . 10 ⊢ (∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) → (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆))
36	30, 35	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆))
37	36	imp 124	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ 𝑔:𝑧⟶𝑆) → (𝐺‘𝑔) ∈ 𝑆)
38	11, 19, 20, 37	syl21anc 1277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → (𝐺‘𝑔) ∈ 𝑆)
39		vex 2824	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
40		opexg 4368	. . . . . . . . . 10 ⊢ ((𝑧 ∈ V ∧ (𝐺‘𝑔) ∈ 𝑆) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
41	39, 38, 40	sylancr 418	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
42		snidg 3738	. . . . . . . . 9 ⊢ (⟨𝑧, (𝐺‘𝑔)⟩ ∈ V → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ {⟨𝑧, (𝐺‘𝑔)⟩})
43		elun2 3397	. . . . . . . . 9 ⊢ (⟨𝑧, (𝐺‘𝑔)⟩ ∈ {⟨𝑧, (𝐺‘𝑔)⟩} → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
44	41, 42, 43	3syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
45		simp3r 1057	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))
46		rspe 2599	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑋 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ∃𝑧 ∈ 𝑋 (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
47	19, 20, 45, 46	syl12anc 1276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ∃𝑧 ∈ 𝑋 (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
48		feq2 5517	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑥 → (𝑔:𝑧⟶𝑆 ↔ 𝑔:𝑥⟶𝑆))
49		raleq 2749	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑥 → (∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)) ↔ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
50	48, 49	anbi12d 477	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑥 → ((𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))) ↔ (𝑔:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))))
51	50	cbvrexv 2787	. . . . . . . . . . . 12 ⊢ (∃𝑧 ∈ 𝑋 (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))) ↔ ∃𝑥 ∈ 𝑋 (𝑔:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
52	47, 51	sylib 122	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ∃𝑥 ∈ 𝑋 (𝑔:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
53		vex 2824	. . . . . . . . . . . 12 ⊢ 𝑔 ∈ V
54		feq1 5516	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑔 → (𝑓:𝑥⟶𝑆 ↔ 𝑔:𝑥⟶𝑆))
55		fveq1 5694	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑦) = (𝑔‘𝑦))
56		reseq1 5057	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = 𝑔 → (𝑓 ↾ 𝑦) = (𝑔 ↾ 𝑦))
57	56	fveq2d 5699	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = 𝑔 → (𝐺‘(𝑓 ↾ 𝑦)) = (𝐺‘(𝑔 ↾ 𝑦)))
58	55, 57	eqeq12d 2253	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)) ↔ (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
59	58	ralbidv 2550	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑔 → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)) ↔ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
60	54, 59	anbi12d 477	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → ((𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) ↔ (𝑔:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))))
61	60	rexbidv 2551	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) ↔ ∃𝑥 ∈ 𝑋 (𝑔:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))))
62		tfrcllemsucfn.1	. . . . . . . . . . . 12 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
63	53, 61, 62	elab2 2974	. . . . . . . . . . 11 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝑋 (𝑔:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))))
64	52, 63	sylibr 134	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝑔 ∈ 𝐴)
65	12, 20, 64	3jca 1208	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → (𝑧 ∈ 𝐷 ∧ 𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴))
66		snexg 4321	. . . . . . . . . . 11 ⊢ (⟨𝑧, (𝐺‘𝑔)⟩ ∈ V → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
67		unexg 4589	. . . . . . . . . . . 12 ⊢ ((𝑔 ∈ V ∧ {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
68	53, 67	mpan 428	. . . . . . . . . . 11 ⊢ ({⟨𝑧, (𝐺‘𝑔)⟩} ∈ V → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
69	41, 66, 68	3syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
70		isset 2828	. . . . . . . . . 10 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V ↔ ∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
71	69, 70	sylib 122	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
72		simpr3 1036	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
73		19.8a 1643	. . . . . . . . . . . . . 14 ⊢ ((𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})))
74		rspe 2599	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ 𝐷 ∧ ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})))
75		tfrcllembacc.3	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
76	75	abeq2i 2349	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ 𝐵 ↔ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})))
77	74, 76	sylibr 134	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐷 ∧ ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ ∈ 𝐵)
78	73, 77	sylan2 286	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ ∈ 𝐵)
79	72, 78	eqeltrrd 2316	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐵)
80	79	3exp2 1256	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝐷 → (𝑔:𝑧⟶𝑆 → (𝑔 ∈ 𝐴 → (ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐵))))
81	80	3imp 1224	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝐷 ∧ 𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴) → (ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐵))
82	81	exlimdv 1872	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝐷 ∧ 𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴) → (∃ℎ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐵))
83	65, 71, 82	sylc 62	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐵)
84		elunii 3940	. . . . . . . 8 ⊢ ((⟨𝑧, (𝐺‘𝑔)⟩ ∈ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∧ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐵) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ ∪ 𝐵)
85	44, 83, 84	syl2anc 415	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ ∪ 𝐵)
86		opeq2 3905	. . . . . . . . . 10 ⊢ (𝑤 = (𝐺‘𝑔) → ⟨𝑧, 𝑤⟩ = ⟨𝑧, (𝐺‘𝑔)⟩)
87	86	eleq1d 2307	. . . . . . . . 9 ⊢ (𝑤 = (𝐺‘𝑔) → (⟨𝑧, 𝑤⟩ ∈ ∪ 𝐵 ↔ ⟨𝑧, (𝐺‘𝑔)⟩ ∈ ∪ 𝐵))
88	87	spcegv 2913	. . . . . . . 8 ⊢ ((𝐺‘𝑔) ∈ 𝑆 → (⟨𝑧, (𝐺‘𝑔)⟩ ∈ ∪ 𝐵 → ∃𝑤⟨𝑧, 𝑤⟩ ∈ ∪ 𝐵))
89	39	eldm2 4979	. . . . . . . 8 ⊢ (𝑧 ∈ dom ∪ 𝐵 ↔ ∃𝑤⟨𝑧, 𝑤⟩ ∈ ∪ 𝐵)
90	88, 89	imbitrrdi 162	. . . . . . 7 ⊢ ((𝐺‘𝑔) ∈ 𝑆 → (⟨𝑧, (𝐺‘𝑔)⟩ ∈ ∪ 𝐵 → 𝑧 ∈ dom ∪ 𝐵))
91	38, 85, 90	sylc 62	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷 ∧ (𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦)))) → 𝑧 ∈ dom ∪ 𝐵)
92	91	3expia 1236	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → ((𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))) → 𝑧 ∈ dom ∪ 𝐵))
93	92	exlimdv 1872	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))) → 𝑧 ∈ dom ∪ 𝐵))
94	93	ralimdva 2617	. . 3 ⊢ (𝜑 → (∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑦 ∈ 𝑧 (𝑔‘𝑦) = (𝐺‘(𝑔 ↾ 𝑦))) → ∀𝑧 ∈ 𝐷 𝑧 ∈ dom ∪ 𝐵))
95	10, 94	mpd 13	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 𝑧 ∈ dom ∪ 𝐵)
96		dfss3 3236	. 2 ⊢ (𝐷 ⊆ dom ∪ 𝐵 ↔ ∀𝑧 ∈ 𝐷 𝑧 ∈ dom ∪ 𝐵)
97	95, 96	sylibr 134	1 ⊢ (𝜑 → 𝐷 ⊆ dom ∪ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009  ∀wal 1400   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∪ cun 3218   ⊆ wss 3220  {csn 3709  ⟨cop 3712  ∪ cuni 3935  Ord word 4507  suc csuc 4510  dom cdm 4774   ↾ cres 4776  Fun wfun 5371  ⟶wf 5373  ‘cfv 5377  recscrecs 6575

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-iord 4511  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385

This theorem is used by:  tfrcllembfn  6628