Theorem tfrcllembfn 6352

Description: Lemma for tfrcl 6359. The union of 𝐵 is a function defined on 𝑥. (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
tfrcllembfn	⊢ (𝜑 → ∪ 𝐵:𝐷⟶𝑆)

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

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

Proof of Theorem tfrcllembfn

Step	Hyp	Ref	Expression
1		tfrcl.f	. . . . . . 7 ⊢ 𝐹 = recs(𝐺)
2		tfrcl.g	. . . . . . 7 ⊢ (𝜑 → Fun 𝐺)
3		tfrcl.x	. . . . . . 7 ⊢ (𝜑 → Ord 𝑋)
4		tfrcl.ex	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
5		tfrcllemsucfn.1	. . . . . . 7 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
6		tfrcllembacc.3	. . . . . . 7 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
7		tfrcllembacc.u	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
8		tfrcllembacc.4	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
9		tfrcllembacc.5	. . . . . . 7 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	tfrcllembacc 6350	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
11	10	unissd 3831	. . . . 5 ⊢ (𝜑 → ∪ 𝐵 ⊆ ∪ 𝐴)
12	5, 3	tfrcllemssrecs 6347	. . . . 5 ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺))
13	11, 12	sstrd 3165	. . . 4 ⊢ (𝜑 → ∪ 𝐵 ⊆ recs(𝐺))
14		tfrfun 6315	. . . 4 ⊢ Fun recs(𝐺)
15		funss 5231	. . . 4 ⊢ (∪ 𝐵 ⊆ recs(𝐺) → (Fun recs(𝐺) → Fun ∪ 𝐵))
16	13, 14, 15	mpisyl 1446	. . 3 ⊢ (𝜑 → Fun ∪ 𝐵)
17		simpr3 1005	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
18		simpl 109	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → 𝜑)
19	3	adantr 276	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → Ord 𝑋)
20		simpr 110	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → 𝑧 ∈ 𝐷)
21	8	adantr 276	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → 𝐷 ∈ 𝑋)
22	20, 21	jca 306	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (𝑧 ∈ 𝐷 ∧ 𝐷 ∈ 𝑋))
23		ordtr1 4385	. . . . . . . . . . . . . . . . . . 19 ⊢ (Ord 𝑋 → ((𝑧 ∈ 𝐷 ∧ 𝐷 ∈ 𝑋) → 𝑧 ∈ 𝑋))
24	19, 22, 23	sylc 62	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → 𝑧 ∈ 𝑋)
25	18, 24	jca 306	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (𝜑 ∧ 𝑧 ∈ 𝑋))
26	2	ad2antrr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Fun 𝐺)
27	3	ad2antrr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Ord 𝑋)
28	4	3adant1r 1231	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
29	28	3adant1r 1231	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
30		simplr 528	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝑋)
31		simpr1 1003	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔:𝑧⟶𝑆)
32		simpr2 1004	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔 ∈ 𝐴)
33	1, 26, 27, 29, 5, 30, 31, 32	tfrcllemsucfn 6348	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}):suc 𝑧⟶𝑆)
34	25, 33	sylan 283	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}):suc 𝑧⟶𝑆)
35		fssxp 5379	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}):suc 𝑧⟶𝑆 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (suc 𝑧 × 𝑆))
36	34, 35	syl 14	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (suc 𝑧 × 𝑆))
37		ordelon 4380	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((Ord 𝑋 ∧ 𝐷 ∈ 𝑋) → 𝐷 ∈ On)
38	3, 8, 37	syl2anc 411	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐷 ∈ On)
39		eloni 4372	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐷 ∈ On → Ord 𝐷)
40	38, 39	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → Ord 𝐷)
41	40	ad2antrr 488	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Ord 𝐷)
42		simplr 528	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝐷)
43		ordsucss 4500	. . . . . . . . . . . . . . . . 17 ⊢ (Ord 𝐷 → (𝑧 ∈ 𝐷 → suc 𝑧 ⊆ 𝐷))
44	41, 42, 43	sylc 62	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → suc 𝑧 ⊆ 𝐷)
45		xpss1 4733	. . . . . . . . . . . . . . . 16 ⊢ (suc 𝑧 ⊆ 𝐷 → (suc 𝑧 × 𝑆) ⊆ (𝐷 × 𝑆))
46	44, 45	syl 14	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (suc 𝑧 × 𝑆) ⊆ (𝐷 × 𝑆))
47	36, 46	sstrd 3165	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (𝐷 × 𝑆))
48		vex 2740	. . . . . . . . . . . . . . . 16 ⊢ 𝑔 ∈ V
49		vex 2740	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑧 ∈ V
50	18	adantr 276	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝜑)
51	24	adantr 276	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝑋)
52		simpr1 1003	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔:𝑧⟶𝑆)
53		feq2 5345	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑥 = 𝑧 → (𝑓:𝑥⟶𝑆 ↔ 𝑓:𝑧⟶𝑆))
54	53	imbi1d 231	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 = 𝑧 → ((𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ (𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)))
55	54	albidv 1824	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ ∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆)))
56	4	3expia 1205	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
57	56	alrimiv 1874	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
58	57	ralrimiva 2550	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
59	58	3ad2ant1 1018	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔:𝑧⟶𝑆) → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓:𝑥⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
60		simp2 998	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔:𝑧⟶𝑆) → 𝑧 ∈ 𝑋)
61	55, 59, 60	rspcdva 2846	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔:𝑧⟶𝑆) → ∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆))
62		simp3 999	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔:𝑧⟶𝑆) → 𝑔:𝑧⟶𝑆)
63		feq1 5344	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑓 = 𝑔 → (𝑓:𝑧⟶𝑆 ↔ 𝑔:𝑧⟶𝑆))
64		fveq2 5511	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔))
65	64	eleq1d 2246	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ 𝑆 ↔ (𝐺‘𝑔) ∈ 𝑆))
66	63, 65	imbi12d 234	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑓 = 𝑔 → ((𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) ↔ (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆)))
67	66	spv 1860	. . . . . . . . . . . . . . . . . . . 20 ⊢ (∀𝑓(𝑓:𝑧⟶𝑆 → (𝐺‘𝑓) ∈ 𝑆) → (𝑔:𝑧⟶𝑆 → (𝐺‘𝑔) ∈ 𝑆))
68	61, 62, 67	sylc 62	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔:𝑧⟶𝑆) → (𝐺‘𝑔) ∈ 𝑆)
69	50, 51, 52, 68	syl3anc 1238	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝐺‘𝑔) ∈ 𝑆)
70		opexg 4225	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑧 ∈ V ∧ (𝐺‘𝑔) ∈ 𝑆) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
71	49, 69, 70	sylancr 414	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
72		snexg 4181	. . . . . . . . . . . . . . . . 17 ⊢ (⟨𝑧, (𝐺‘𝑔)⟩ ∈ V → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
73	71, 72	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
74		unexg 4440	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 ∈ V ∧ {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
75	48, 73, 74	sylancr 414	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
76		elpwg 3582	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝒫 (𝐷 × 𝑆) ↔ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (𝐷 × 𝑆)))
77	75, 76	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝒫 (𝐷 × 𝑆) ↔ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (𝐷 × 𝑆)))
78	47, 77	mpbird 167	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝒫 (𝐷 × 𝑆))
79	17, 78	eqeltrd 2254	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ ∈ 𝒫 (𝐷 × 𝑆))
80	79	ex 115	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → ((𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝒫 (𝐷 × 𝑆)))
81	80	exlimdv 1819	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝒫 (𝐷 × 𝑆)))
82	81	rexlimdva 2594	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝒫 (𝐷 × 𝑆)))
83	82	abssdv 3229	. . . . . . . 8 ⊢ (𝜑 → {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))} ⊆ 𝒫 (𝐷 × 𝑆))
84	6, 83	eqsstrid 3201	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝒫 (𝐷 × 𝑆))
85		sspwuni 3968	. . . . . . 7 ⊢ (𝐵 ⊆ 𝒫 (𝐷 × 𝑆) ↔ ∪ 𝐵 ⊆ (𝐷 × 𝑆))
86	84, 85	sylib 122	. . . . . 6 ⊢ (𝜑 → ∪ 𝐵 ⊆ (𝐷 × 𝑆))
87		dmss 4822	. . . . . 6 ⊢ (∪ 𝐵 ⊆ (𝐷 × 𝑆) → dom ∪ 𝐵 ⊆ dom (𝐷 × 𝑆))
88	86, 87	syl 14	. . . . 5 ⊢ (𝜑 → dom ∪ 𝐵 ⊆ dom (𝐷 × 𝑆))
89		dmxpss 5055	. . . . 5 ⊢ dom (𝐷 × 𝑆) ⊆ 𝐷
90	88, 89	sstrdi 3167	. . . 4 ⊢ (𝜑 → dom ∪ 𝐵 ⊆ 𝐷)
91	1, 2, 3, 4, 5, 6, 7, 8, 9	tfrcllembxssdm 6351	. . . 4 ⊢ (𝜑 → 𝐷 ⊆ dom ∪ 𝐵)
92	90, 91	eqssd 3172	. . 3 ⊢ (𝜑 → dom ∪ 𝐵 = 𝐷)
93		df-fn 5215	. . 3 ⊢ (∪ 𝐵 Fn 𝐷 ↔ (Fun ∪ 𝐵 ∧ dom ∪ 𝐵 = 𝐷))
94	16, 92, 93	sylanbrc 417	. 2 ⊢ (𝜑 → ∪ 𝐵 Fn 𝐷)
95		rnss 4853	. . . 4 ⊢ (∪ 𝐵 ⊆ (𝐷 × 𝑆) → ran ∪ 𝐵 ⊆ ran (𝐷 × 𝑆))
96	86, 95	syl 14	. . 3 ⊢ (𝜑 → ran ∪ 𝐵 ⊆ ran (𝐷 × 𝑆))
97		rnxpss 5056	. . 3 ⊢ ran (𝐷 × 𝑆) ⊆ 𝑆
98	96, 97	sstrdi 3167	. 2 ⊢ (𝜑 → ran ∪ 𝐵 ⊆ 𝑆)
99		df-f 5216	. 2 ⊢ (∪ 𝐵:𝐷⟶𝑆 ↔ (∪ 𝐵 Fn 𝐷 ∧ ran ∪ 𝐵 ⊆ 𝑆))
100	94, 98, 99	sylanbrc 417	1 ⊢ (𝜑 → ∪ 𝐵:𝐷⟶𝑆)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 978  ∀wal 1351   = wceq 1353  ∃wex 1492   ∈ wcel 2148  {cab 2163  ∀wral 2455  ∃wrex 2456  Vcvv 2737   ∪ cun 3127   ⊆ wss 3129  𝒫 cpw 3574  {csn 3591  ⟨cop 3594  ∪ cuni 3807  Ord word 4359  Oncon0 4360  suc csuc 4362   × cxp 4621  dom cdm 4623  ran crn 4624   ↾ cres 4625  Fun wfun 5206   Fn wfn 5207  ⟶wf 5208  ‘cfv 5212  recscrecs 6299

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-iord 4363  df-on 4365  df-suc 4368  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-recs 6300

This theorem is referenced by:  tfrcllembex  6353  tfrcllemubacc  6354  tfrcllemex  6355