Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  csbwrecsg Structured version   Visualization version   GIF version

Theorem csbwrecsg 33144
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.
StepHypRef Expression
1 csbuni 4457 . . 3 𝐴 / 𝑥 {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = 𝐴 / 𝑥{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
2 csbab 3999 . . . . 5 𝐴 / 𝑥{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓[𝐴 / 𝑥]𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
3 sbcex2 3480 . . . . . . 7 ([𝐴 / 𝑥]𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧[𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
4 sbc3an 3488 . . . . . . . . 9 ([𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ([𝐴 / 𝑥]𝑓 Fn 𝑧[𝐴 / 𝑥](𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ [𝐴 / 𝑥]𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
5 sbcg 3497 . . . . . . . . . 10 (𝐴𝑉 → ([𝐴 / 𝑥]𝑓 Fn 𝑧𝑓 Fn 𝑧))
6 sbcan 3472 . . . . . . . . . . 11 ([𝐴 / 𝑥](𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ ([𝐴 / 𝑥]𝑧𝐷[𝐴 / 𝑥]𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
7 sbcssg 4076 . . . . . . . . . . . . 13 (𝐴𝑉 → ([𝐴 / 𝑥]𝑧𝐷𝐴 / 𝑥𝑧𝐴 / 𝑥𝐷))
8 csbconstg 3539 . . . . . . . . . . . . . 14 (𝐴𝑉𝐴 / 𝑥𝑧 = 𝑧)
98sseq1d 3624 . . . . . . . . . . . . 13 (𝐴𝑉 → (𝐴 / 𝑥𝑧𝐴 / 𝑥𝐷𝑧𝐴 / 𝑥𝐷))
107, 9bitrd 268 . . . . . . . . . . . 12 (𝐴𝑉 → ([𝐴 / 𝑥]𝑧𝐷𝑧𝐴 / 𝑥𝐷))
11 sbcralg 3507 . . . . . . . . . . . . 13 (𝐴𝑉 → ([𝐴 / 𝑥]𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦𝑧 [𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
12 sbcssg 4076 . . . . . . . . . . . . . . 15 (𝐴𝑉 → ([𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦) ⊆ 𝐴 / 𝑥𝑧))
138sseq2d 3625 . . . . . . . . . . . . . . 15 (𝐴𝑉 → (𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦) ⊆ 𝐴 / 𝑥𝑧𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧))
14 csbpredg 33143 . . . . . . . . . . . . . . . . 17 (𝐴𝑉𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦) = Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝐴 / 𝑥𝑦))
15 csbconstg 3539 . . . . . . . . . . . . . . . . . 18 (𝐴𝑉𝐴 / 𝑥𝑦 = 𝑦)
16 predeq3 5672 . . . . . . . . . . . . . . . . . 18 (𝐴 / 𝑥𝑦 = 𝑦 → Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝐴 / 𝑥𝑦) = Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))
1715, 16syl 17 . . . . . . . . . . . . . . . . 17 (𝐴𝑉 → Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝐴 / 𝑥𝑦) = Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))
1814, 17eqtrd 2654 . . . . . . . . . . . . . . . 16 (𝐴𝑉𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦) = Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))
1918sseq1d 3624 . . . . . . . . . . . . . . 15 (𝐴𝑉 → (𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧))
2012, 13, 193bitrd 294 . . . . . . . . . . . . . 14 (𝐴𝑉 → ([𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧))
2120ralbidv 2983 . . . . . . . . . . . . 13 (𝐴𝑉 → (∀𝑦𝑧 [𝐴 / 𝑥]Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧))
2211, 21bitrd 268 . . . . . . . . . . . 12 (𝐴𝑉 → ([𝐴 / 𝑥]𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧 ↔ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧))
2310, 22anbi12d 746 . . . . . . . . . . 11 (𝐴𝑉 → (([𝐴 / 𝑥]𝑧𝐷[𝐴 / 𝑥]𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧)))
246, 23syl5bb 272 . . . . . . . . . 10 (𝐴𝑉 → ([𝐴 / 𝑥](𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ↔ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧)))
25 sbcralg 3507 . . . . . . . . . . 11 (𝐴𝑉 → ([𝐴 / 𝑥]𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦𝑧 [𝐴 / 𝑥](𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
26 sbceqg 3975 . . . . . . . . . . . . 13 (𝐴𝑉 → ([𝐴 / 𝑥](𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ 𝐴 / 𝑥(𝑓𝑦) = 𝐴 / 𝑥(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))))
27 csbconstg 3539 . . . . . . . . . . . . . 14 (𝐴𝑉𝐴 / 𝑥(𝑓𝑦) = (𝑓𝑦))
28 csbfv12 6218 . . . . . . . . . . . . . . 15 𝐴 / 𝑥(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (𝐴 / 𝑥𝐹𝐴 / 𝑥(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))
29 csbres 5388 . . . . . . . . . . . . . . . . 17 𝐴 / 𝑥(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)) = (𝐴 / 𝑥𝑓𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦))
30 csbconstg 3539 . . . . . . . . . . . . . . . . . 18 (𝐴𝑉𝐴 / 𝑥𝑓 = 𝑓)
3130, 18reseq12d 5386 . . . . . . . . . . . . . . . . 17 (𝐴𝑉 → (𝐴 / 𝑥𝑓𝐴 / 𝑥Pred(𝑅, 𝐷, 𝑦)) = (𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦)))
3229, 31syl5eq 2666 . . . . . . . . . . . . . . . 16 (𝐴𝑉𝐴 / 𝑥(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)) = (𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦)))
3332fveq2d 6182 . . . . . . . . . . . . . . 15 (𝐴𝑉 → (𝐴 / 𝑥𝐹𝐴 / 𝑥(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))
3428, 33syl5eq 2666 . . . . . . . . . . . . . 14 (𝐴𝑉𝐴 / 𝑥(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))
3527, 34eqeq12d 2635 . . . . . . . . . . . . 13 (𝐴𝑉 → (𝐴 / 𝑥(𝑓𝑦) = 𝐴 / 𝑥(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦)))))
3626, 35bitrd 268 . . . . . . . . . . . 12 (𝐴𝑉 → ([𝐴 / 𝑥](𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦)))))
3736ralbidv 2983 . . . . . . . . . . 11 (𝐴𝑉 → (∀𝑦𝑧 [𝐴 / 𝑥](𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦)))))
3825, 37bitrd 268 . . . . . . . . . 10 (𝐴𝑉 → ([𝐴 / 𝑥]𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))) ↔ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦)))))
395, 24, 383anbi123d 1397 . . . . . . . . 9 (𝐴𝑉 → (([𝐴 / 𝑥]𝑓 Fn 𝑧[𝐴 / 𝑥](𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ [𝐴 / 𝑥]𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ (𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))))
404, 39syl5bb 272 . . . . . . . 8 (𝐴𝑉 → ([𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ (𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))))
4140exbidv 1848 . . . . . . 7 (𝐴𝑉 → (∃𝑧[𝐴 / 𝑥](𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))))
423, 41syl5bb 272 . . . . . 6 (𝐴𝑉 → ([𝐴 / 𝑥]𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦)))) ↔ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))))
4342abbidv 2739 . . . . 5 (𝐴𝑉 → {𝑓[𝐴 / 𝑥]𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))})
442, 43syl5eq 2666 . . . 4 (𝐴𝑉𝐴 / 𝑥{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))})
4544unieqd 4437 . . 3 (𝐴𝑉 𝐴 / 𝑥{𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))})
461, 45syl5eq 2666 . 2 (𝐴𝑉𝐴 / 𝑥 {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))} = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))})
47 df-wrecs 7392 . . 3 wrecs(𝑅, 𝐷, 𝐹) = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
4847csbeq2i 3984 . 2 𝐴 / 𝑥wrecs(𝑅, 𝐷, 𝐹) = 𝐴 / 𝑥 {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐷 ∧ ∀𝑦𝑧 Pred(𝑅, 𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐷, 𝑦))))}
49 df-wrecs 7392 . 2 wrecs(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝐴 / 𝑥𝐹) = {𝑓 ∣ ∃𝑧(𝑓 Fn 𝑧 ∧ (𝑧𝐴 / 𝑥𝐷 ∧ ∀𝑦𝑧 Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦) ⊆ 𝑧) ∧ ∀𝑦𝑧 (𝑓𝑦) = (𝐴 / 𝑥𝐹‘(𝑓 ↾ Pred(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝑦))))}
5046, 48, 493eqtr4g 2679 1 (𝐴𝑉𝐴 / 𝑥wrecs(𝑅, 𝐷, 𝐹) = wrecs(𝐴 / 𝑥𝑅, 𝐴 / 𝑥𝐷, 𝐴 / 𝑥𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  w3a 1036   = wceq 1481  wex 1702  wcel 1988  {cab 2606  wral 2909  [wsbc 3429  csb 3526  wss 3567   cuni 4427  cres 5106  Predcpred 5667   Fn wfn 5871  cfv 5876  wrecscwrecs 7391
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-fal 1487  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-xp 5110  df-cnv 5112  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-pred 5668  df-iota 5839  df-fv 5884  df-wrecs 7392
This theorem is referenced by:  csbrecsg  33145
  Copyright terms: Public domain W3C validator