Theorem csbwrecsg 35184

Description: Move class substitution in and out of the well-founded recursive function generator. (Contributed by ML, 25-Oct-2020.)

Assertion

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

Proof of Theorem csbwrecsg

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

Step	Hyp	Ref	Expression
1		csbuni 4836	. . 3 ⊢ ⦋𝐴 / 𝑥⦌∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = ∪ ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
2		csbab 4338	. . . . 5 ⊢ ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ [𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
3		sbcex2 3748	. . . . . . 7 ⊢ ([𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧[𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
4		sbc3an 3752	. . . . . . . . 9 ⊢ ([𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ([𝐴 / 𝑥]𝑓 Fn 𝑧 ∧ [𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
5		sbcg 3761	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑓 Fn 𝑧 ↔ 𝑓 Fn 𝑧))
6		sbcan 3735	. . . . . . . . . . 11 ⊢ ([𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ ([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
7		sbcssg 4421	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ↔ ⦋𝐴 / 𝑥⦌𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
8		csbconstg 3817	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑧 = 𝑧)
9	8	sseq1d 3918	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ↔ 𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
10	7, 9	bitrd 282	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ↔ 𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷))
11		sbcralg 3773	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑧 [𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
12		sbcssg 4421	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) ⊆ ⦋𝐴 / 𝑥⦌𝑧))
13	8	sseq2d 3919	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) ⊆ ⦋𝐴 / 𝑥⦌𝑧 ↔ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
14		csbpredg 35183	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑦))
15		csbconstg 3817	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑦 = 𝑦)
16		predeq3 6144	. . . . . . . . . . . . . . . . . 18 ⊢ (⦋𝐴 / 𝑥⦌𝑦 = 𝑦 → Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))
17	15, 16	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))
18	14, 17	eqtrd 2771	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))
19	18	sseq1d 3918	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
20	12, 13, 19	3bitrd 308	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
21	20	ralbidv 3108	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦 ∈ 𝑧 [𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
22	11, 21	bitrd 282	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧))
23	10, 22	anbi12d 634	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑧 ⊆ 𝐷 ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧)))
24	6, 23	syl5bb 286	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧)))
25		sbcralg 3773	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦 ∈ 𝑧 [𝐴 / 𝑥](𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
26		sbceqg 4310	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ⦋𝐴 / 𝑥⦌(𝑓‘𝑦) = ⦋𝐴 / 𝑥⦌(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
27		csbconstg 3817	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑓‘𝑦) = (𝑓‘𝑦))
28		csbfv12 6738	. . . . . . . . . . . . . . 15 ⊢ ⦋𝐴 / 𝑥⦌(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (⦋𝐴 / 𝑥⦌𝐹‘⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))
29		csbres 5839	. . . . . . . . . . . . . . . . 17 ⊢ ⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)) = (⦋𝐴 / 𝑥⦌𝑓 ↾ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦))
30		csbconstg 3817	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑓 = 𝑓)
31	30, 18	reseq12d 5837	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑓 ↾ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑦)) = (𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))
32	29, 31	syl5eq 2783	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)) = (𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))
33	32	fveq2d 6699	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝐹‘⦋𝐴 / 𝑥⦌(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))
34	28, 33	syl5eq 2783	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))
35	27, 34	eqeq12d 2752	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌(𝑓‘𝑦) = ⦋𝐴 / 𝑥⦌(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
36	26, 35	bitrd 282	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
37	36	ralbidv 3108	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦 ∈ 𝑧 [𝐴 / 𝑥](𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
38	25, 37	bitrd 282	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦)))))
39	5, 24, 38	3anbi123d 1438	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑓 Fn 𝑧 ∧ [𝐴 / 𝑥](𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ [𝐴 / 𝑥]∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ (𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
40	4, 39	syl5bb 286	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ (𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
41	40	exbidv 1929	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (∃𝑧[𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
42	3, 41	syl5bb 286	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))))
43	42	abbidv 2800	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ [𝐴 / 𝑥]∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
44	2, 43	syl5eq 2783	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
45	44	unieqd 4819	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ ⦋𝐴 / 𝑥⦌{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
46	1, 45	syl5eq 2783	. 2 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))})
47		df-wrecs 8025	. . 3 ⊢ wrecs(𝑅, 𝐷, 𝐹) = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
48	47	csbeq2i 3806	. 2 ⊢ ⦋𝐴 / 𝑥⦌wrecs(𝑅, 𝐷, 𝐹) = ⦋𝐴 / 𝑥⦌∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ 𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
49		df-wrecs 8025	. 2 ⊢ wrecs(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝐹) = ∪ {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧 ⊆ ⦋𝐴 / 𝑥⦌𝐷 ∧ ∀𝑦 ∈ 𝑧 Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦 ∈ 𝑧 (𝑓‘𝑦) = (⦋𝐴 / 𝑥⦌𝐹‘(𝑓 ↾ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, 𝑦))))}
50	46, 48, 49	3eqtr4g 2796	1 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌wrecs(𝑅, 𝐷, 𝐹) = wrecs(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝐹))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1089   = wceq 1543  ∃wex 1787   ∈ wcel 2112  {cab 2714  ∀wral 3051  [wsbc 3683  ⦋csb 3798   ⊆ wss 3853  ∪ cuni 4805   ↾ cres 5538  Predcpred 6139   Fn wfn 6353  ‘cfv 6358  wrecscwrecs 8024

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-xp 5542  df-cnv 5544  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6140  df-iota 6316  df-fv 6366  df-wrecs 8025

This theorem is referenced by:  csbrecsg  35185