![]() |
Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > frrlem5 | Structured version Visualization version GIF version |
Description: Lemma for founded recursion. State the 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 33231 | . 2 ⊢ frecs(𝑅, 𝐴, 𝐺) = ∪ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
2 | frrlem5.2 | . 2 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) | |
3 | frrlem5.1 | . . 3 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
4 | 3 | unieqi 4813 | . 2 ⊢ ∪ 𝐵 = ∪ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} |
5 | 1, 2, 4 | 3eqtr4i 2831 | 1 ⊢ 𝐹 = ∪ 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∃wex 1781 {cab 2776 ∀wral 3106 ⊆ wss 3881 ∪ cuni 4800 ↾ cres 5521 Predcpred 6115 Fn wfn 6319 ‘cfv 6324 (class class class)co 7135 frecscfrecs 33230 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-in 3888 df-ss 3898 df-uni 4801 df-frecs 33231 |
This theorem is referenced by: frrlem6 33241 frrlem7 33242 frrlem8 33243 frrlem9 33244 frrlem10 33245 frrlem14 33249 |
Copyright terms: Public domain | W3C validator |