| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frrlem5 | Structured version Visualization version GIF version | ||
| Description: Lemma for well-founded recursion. State the well-founded recursion generator in terms of the acceptable functions. (Contributed by Scott Fenton, 27-Aug-2022.) |
| Ref | Expression |
|---|---|
| frrlem5.1 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} |
| frrlem5.2 | ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) |
| Ref | Expression |
|---|---|
| frrlem5 | ⊢ 𝐹 = ∪ 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-frecs 8337 | . 2 ⊢ frecs(𝑅, 𝐴, 𝐺) = ∪ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
| 2 | frrlem5.2 | . 2 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) | |
| 3 | frrlem5.1 | . . 3 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
| 4 | 3 | unieqi 4884 | . 2 ⊢ ∪ 𝐵 = ∪ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} |
| 5 | 1, 2, 4 | 3eqtr4i 2796 | 1 ⊢ 𝐹 = ∪ 𝐵 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 {cab 2741 ∀wral 3080 ⊆ wss 3900 ∪ cuni 4872 ↾ cres 5660 Predcpred 6329 Fn wfn 6561 ‘cfv 6566 (class class class)co 7451 frecscfrecs 8336 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-uni 4873 df-frecs 8337 |
| This theorem is used by: frrlem6 8347 frrlem7 8348 frrlem8 8349 frrlem9 8350 frrlem10 8351 frrlem14 8355 |
| Copyright terms: Public domain | W3C validator |