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 33122 | . 2 ⊢ frecs(𝑅, 𝐴, 𝐺) = ∪ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
2 | frrlem5.2 | . 2 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) | |
3 | frrlem5.1 | . . 3 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
4 | 3 | unieqi 4854 | . 2 ⊢ ∪ 𝐵 = ∪ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} |
5 | 1, 2, 4 | 3eqtr4i 2857 | 1 ⊢ 𝐹 = ∪ 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 ∧ w3a 1083 = wceq 1536 ∃wex 1779 {cab 2802 ∀wral 3141 ⊆ wss 3939 ∪ cuni 4841 ↾ cres 5560 Predcpred 6150 Fn wfn 6353 ‘cfv 6358 (class class class)co 7159 frecscfrecs 33121 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-v 3499 df-in 3946 df-ss 3955 df-uni 4842 df-frecs 33122 |
This theorem is referenced by: frrlem6 33132 frrlem7 33133 frrlem8 33134 frrlem9 33135 frrlem10 33136 frrlem14 33140 |
Copyright terms: Public domain | W3C validator |