Theorem tfr1onlembfn 6453

Description: Lemma for tfr1on 6459. The union of 𝐵 is a function defined on 𝑥. (Contributed by Jim Kingdon, 15-Mar-2022.)

Hypotheses

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

Assertion

Ref	Expression
tfr1onlembfn	⊢ (𝜑 → ∪ 𝐵 Fn 𝐷)

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

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

Proof of Theorem tfr1onlembfn

Step	Hyp	Ref	Expression
1		tfr1on.f	. . . . . 6 ⊢ 𝐹 = recs(𝐺)
2		tfr1on.g	. . . . . 6 ⊢ (𝜑 → Fun 𝐺)
3		tfr1on.x	. . . . . 6 ⊢ (𝜑 → Ord 𝑋)
4		tfr1on.ex	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
5		tfr1onlemsucfn.1	. . . . . 6 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
6		tfr1onlembacc.3	. . . . . 6 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
7		tfr1onlembacc.u	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
8		tfr1onlembacc.4	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
9		tfr1onlembacc.5	. . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	tfr1onlembacc 6451	. . . . 5 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
11	10	unissd 3888	. . . 4 ⊢ (𝜑 → ∪ 𝐵 ⊆ ∪ 𝐴)
12	5, 3	tfr1onlemssrecs 6448	. . . 4 ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺))
13	11, 12	sstrd 3211	. . 3 ⊢ (𝜑 → ∪ 𝐵 ⊆ recs(𝐺))
14		tfrfun 6429	. . 3 ⊢ Fun recs(𝐺)
15		funss 5309	. . 3 ⊢ (∪ 𝐵 ⊆ recs(𝐺) → (Fun recs(𝐺) → Fun ∪ 𝐵))
16	13, 14, 15	mpisyl 1467	. 2 ⊢ (𝜑 → Fun ∪ 𝐵)
17		simpr3 1008	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
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 4453	. . . . . . . . . . . . . . . . . . 19 ⊢ (Ord 𝑋 → ((𝑧 ∈ 𝐷 ∧ 𝐷 ∈ 𝑋) → 𝑧 ∈ 𝑋))
24	19, 22, 23	sylc 62	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → 𝑧 ∈ 𝑋)
25	18, 24	jca 306	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (𝜑 ∧ 𝑧 ∈ 𝑋))
26	2	ad2antrr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Fun 𝐺)
27	3	ad2antrr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Ord 𝑋)
28	4	3adant1r 1234	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
29	28	3adant1r 1234	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
30		simplr 528	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝑋)
31		simpr1 1006	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔 Fn 𝑧)
32		simpr2 1007	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔 ∈ 𝐴)
33	1, 26, 27, 29, 5, 30, 31, 32	tfr1onlemsucfn 6449	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑋) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧)
34	25, 33	sylan 283	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧)
35		dffn2 5447	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧 ↔ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}):suc 𝑧⟶V)
36	34, 35	sylib 122	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}):suc 𝑧⟶V)
37		fssxp 5463	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}):suc 𝑧⟶V → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (suc 𝑧 × V))
38	36, 37	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (suc 𝑧 × V))
39		ordelon 4448	. . . . . . . . . . . . . . . . . . 19 ⊢ ((Ord 𝑋 ∧ 𝐷 ∈ 𝑋) → 𝐷 ∈ On)
40	3, 8, 39	syl2anc 411	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐷 ∈ On)
41		eloni 4440	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐷 ∈ On → Ord 𝐷)
42	40, 41	syl 14	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → Ord 𝐷)
43	42	ad2antrr 488	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Ord 𝐷)
44		simplr 528	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝐷)
45		ordsucss 4570	. . . . . . . . . . . . . . . 16 ⊢ (Ord 𝐷 → (𝑧 ∈ 𝐷 → suc 𝑧 ⊆ 𝐷))
46	43, 44, 45	sylc 62	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → suc 𝑧 ⊆ 𝐷)
47		xpss1 4803	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑧 ⊆ 𝐷 → (suc 𝑧 × V) ⊆ (𝐷 × V))
48	46, 47	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (suc 𝑧 × V) ⊆ (𝐷 × V))
49	38, 48	sstrd 3211	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (𝐷 × V))
50		vex 2779	. . . . . . . . . . . . . . 15 ⊢ 𝑔 ∈ V
51		vex 2779	. . . . . . . . . . . . . . . . 17 ⊢ 𝑧 ∈ V
52	18	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝜑)
53	24	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝑋)
54		simpr1 1006	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔 Fn 𝑧)
55		fneq2 5382	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 = 𝑧 → (𝑓 Fn 𝑥 ↔ 𝑓 Fn 𝑧))
56	55	imbi1d 231	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑧 → ((𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ (𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
57	56	albidv 1848	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
58	4	3expia 1208	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
59	58	alrimiv 1898	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
60	59	ralrimiva 2581	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
61	60	3ad2ant1 1021	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔 Fn 𝑧) → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
62		simp2 1001	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔 Fn 𝑧) → 𝑧 ∈ 𝑋)
63	57, 61, 62	rspcdva 2889	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔 Fn 𝑧) → ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V))
64		simp3 1002	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔 Fn 𝑧) → 𝑔 Fn 𝑧)
65		fneq1 5381	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝑧 ↔ 𝑔 Fn 𝑧))
66		fveq2 5599	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔))
67	66	eleq1d 2276	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ V ↔ (𝐺‘𝑔) ∈ V))
68	65, 67	imbi12d 234	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑔 → ((𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) ↔ (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V)))
69	68	spv 1884	. . . . . . . . . . . . . . . . . . 19 ⊢ (∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) → (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V))
70	63, 64, 69	sylc 62	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋 ∧ 𝑔 Fn 𝑧) → (𝐺‘𝑔) ∈ V)
71	52, 53, 54, 70	syl3anc 1250	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝐺‘𝑔) ∈ V)
72		opexg 4290	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑧 ∈ V ∧ (𝐺‘𝑔) ∈ V) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
73	51, 71, 72	sylancr 414	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ⟨𝑧, (𝐺‘𝑔)⟩ ∈ V)
74		snexg 4244	. . . . . . . . . . . . . . . 16 ⊢ (⟨𝑧, (𝐺‘𝑔)⟩ ∈ V → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
75	73, 74	syl 14	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V)
76		unexg 4508	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 ∈ V ∧ {⟨𝑧, (𝐺‘𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
77	50, 75, 76	sylancr 414	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V)
78		elpwg 3634	. . . . . . . . . . . . . 14 ⊢ ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ V → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝒫 (𝐷 × V) ↔ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (𝐷 × V)))
79	77, 78	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ((𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝒫 (𝐷 × V) ↔ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ⊆ (𝐷 × V)))
80	49, 79	mpbird 167	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝒫 (𝐷 × V))
81	17, 80	eqeltrd 2284	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ ∈ 𝒫 (𝐷 × V))
82	81	ex 115	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → ((𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝒫 (𝐷 × V)))
83	82	exlimdv 1843	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝒫 (𝐷 × V)))
84	83	rexlimdva 2625	. . . . . . . 8 ⊢ (𝜑 → (∃𝑧 ∈ 𝐷 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝒫 (𝐷 × V)))
85	84	abssdv 3275	. . . . . . 7 ⊢ (𝜑 → {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))} ⊆ 𝒫 (𝐷 × V))
86	6, 85	eqsstrid 3247	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝒫 (𝐷 × V))
87		sspwuni 4026	. . . . . 6 ⊢ (𝐵 ⊆ 𝒫 (𝐷 × V) ↔ ∪ 𝐵 ⊆ (𝐷 × V))
88	86, 87	sylib 122	. . . . 5 ⊢ (𝜑 → ∪ 𝐵 ⊆ (𝐷 × V))
89		dmss 4896	. . . . 5 ⊢ (∪ 𝐵 ⊆ (𝐷 × V) → dom ∪ 𝐵 ⊆ dom (𝐷 × V))
90	88, 89	syl 14	. . . 4 ⊢ (𝜑 → dom ∪ 𝐵 ⊆ dom (𝐷 × V))
91		dmxpss 5132	. . . 4 ⊢ dom (𝐷 × V) ⊆ 𝐷
92	90, 91	sstrdi 3213	. . 3 ⊢ (𝜑 → dom ∪ 𝐵 ⊆ 𝐷)
93	1, 2, 3, 4, 5, 6, 7, 8, 9	tfr1onlembxssdm 6452	. . 3 ⊢ (𝜑 → 𝐷 ⊆ dom ∪ 𝐵)
94	92, 93	eqssd 3218	. 2 ⊢ (𝜑 → dom ∪ 𝐵 = 𝐷)
95		df-fn 5293	. 2 ⊢ (∪ 𝐵 Fn 𝐷 ↔ (Fun ∪ 𝐵 ∧ dom ∪ 𝐵 = 𝐷))
96	16, 94, 95	sylanbrc 417	1 ⊢ (𝜑 → ∪ 𝐵 Fn 𝐷)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 981  ∀wal 1371   = wceq 1373  ∃wex 1516   ∈ wcel 2178  {cab 2193  ∀wral 2486  ∃wrex 2487  Vcvv 2776   ∪ cun 3172   ⊆ wss 3174  𝒫 cpw 3626  {csn 3643  ⟨cop 3646  ∪ cuni 3864  Ord word 4427  Oncon0 4428  suc csuc 4430   × cxp 4691  dom cdm 4693   ↾ cres 4695  Fun wfun 5284   Fn wfn 5285  ⟶wf 5286  ‘cfv 5290  recscrecs 6413

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-iord 4431  df-on 4433  df-suc 4436  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-fv 5298  df-recs 6414

This theorem is referenced by:  tfr1onlembex  6454  tfr1onlemubacc  6455  tfr1onlemex  6456