Theorem csbfrecsg 8306

Description: Move class substitution in and out of the well-founded recursive function generator. (Contributed by Scott Fenton, 18-Nov-2024.)

Assertion

Ref	Expression
csbfrecsg	⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌frecs(𝑅, 𝐷, 𝐹) = frecs(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝐹))

Proof of Theorem csbfrecsg

Dummy variables 𝑓 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		csbuni 4897	. . 3 ⊢ ⦋𝐴 / 𝑥⦌∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = ∪ ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
2		csbab 4397	. . . . 5 ⊢ ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ [𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
3		sbcex2 3798	. . . . . . 7 ⊢ ([𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧[𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
4		sbc3an 3802	. . . . . . . . 9 ⊢ ([𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ([𝐴 / 𝑥]𝑓 Fn 𝑧 ∧ [𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
5		sbcg 3810	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑓 Fn 𝑧 ↔ 𝑓 Fn 𝑧))
6		sbcan 3787	. . . . . . . . . . 11 ⊢ ([𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ ([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
7		sbcssg 4476	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ↔ ⦋𝐴 / 𝑥⦌𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
8		csbconstg 3865	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑧 = 𝑧)
9	8	sseq1d 3939	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ↔ 𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
10	7, 9	bitrd 282	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ↔ 𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
11		sbcralg 3820	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑧 [𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
12		sbcssg 4476	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) ⊆ ⦋𝐴 / 𝑥⦌𝑧))
13		csbpredg 6310	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑦))
14		csbconstg 3865	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑦 = 𝑦)
15		predeq3 6308	. . . . . . . . . . . . . . . . . 18 ⊢ (⦋𝐴 / 𝑥⦌𝑦 = 𝑦 → Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))
16	14, 15	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))
17	13, 16	eqtrd 2795	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))
18	17, 8	sseq12d 3941	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) ⊆ ⦋𝐴 / 𝑥⦌𝑧 ↔ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
19	12, 18	bitrd 282	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
20	19	ralbidv 3185	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦 ∈ 𝑧 [𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
21	11, 20	bitrd 282	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
22	10, 21	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧)))
23	6, 22	bitrid 286	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧)))
24		sbcralg 3820	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦 ∈ 𝑧 [𝐴 / 𝑥](𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
25		sbceqg 4369	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ⦋𝐴 / 𝑥⦌(𝑓‘𝑦) = ⦋𝐴 / 𝑥⦌(𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
26		csbconstg 3865	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑓‘𝑦) = (𝑓‘𝑦))
27		csbov123 7465	. . . . . . . . . . . . . . 15 ⊢ ⦋𝐴 / 𝑥⦌(𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (⦋𝐴 / 𝑥⦌𝑦⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))
28		csbres 5972	. . . . . . . . . . . . . . . . 17 ⊢ ⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)) = (⦋𝐴 / 𝑥⦌𝑓 ↾ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦))
29		csbconstg 3865	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑓 = 𝑓)
30	29, 17	reseq12d 5970	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑓 ↾ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦)) = (𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))
31	28, 30	eqtrid 2807	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)) = (𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))
32	14, 31	oveq12d 7439	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑦⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))
33	27, 32	eqtrid 2807	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))
34	26, 33	eqeq12d 2776	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌(𝑓‘𝑦) = ⦋𝐴 / 𝑥⦌(𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
35	25, 34	bitrd 282	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
36	35	ralbidv 3185	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦 ∈ 𝑧 [𝐴 / 𝑥](𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
37	24, 36	bitrd 282	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
38	5, 23, 37	3anbi123d 1464	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑓 Fn 𝑧 ∧ [𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ (𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
39	4, 38	bitrid 286	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ (𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
40	39	exbidv 1953	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (∃𝑧[𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
41	3, 40	bitrid 286	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
42	41	abbidv 2826	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ [𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
43	2, 42	eqtrid 2807	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
44	43	unieqd 4879	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
45	1, 44	eqtrid 2807	. 2 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
46		df-frecs 8303	. . 3 ⊢ frecs(𝑅, 𝐷, 𝐹) = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
47	46	csbeq2i 3854	. 2 ⊢ ⦋𝐴 / 𝑥⦌frecs(𝑅, 𝐷, 𝐹) = ⦋𝐴 / 𝑥⦌∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦𝐹(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
48		df-frecs 8303	. 2 ⊢ frecs(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝐹) = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝑦⦋𝐴 / 𝑥⦌𝐹(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))}
49	45, 47, 48	3eqtr4g 2820	1 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌frecs(𝑅, 𝐷, 𝐹) = frecs(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝐹))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ∀wral 3076  [wsbc 3738  ⦋csb 3846   ⊆ wss 3895  ∪ cuni 4866   ↾ cres 5652  Predcpred 6303   Fn wfn 6534  ‘cfv 6539  (class class class)co 7421  frecscfrecs 8302

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5656  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-iota 6494  df-fv 6547  df-ov 7424  df-frecs 8303

This theorem is used by:  csbwrecsg  8340