| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frrrel | Structured version Visualization version GIF version | ||
| Description: Show without using the axiom of replacement that the well-founded recursion generator gives a relation. (Contributed by Scott Fenton, 18-Nov-2024.) |
| Ref | Expression |
|---|---|
| frrrel.1 | ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) |
| Ref | Expression |
|---|---|
| frrrel | ⊢ Rel 𝐹 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . 2 ⊢ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
| 2 | frrrel.1 | . 2 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) | |
| 3 | 1, 2 | frrlem6 8347 | 1 ⊢ Rel 𝐹 |
| 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 ↾ cres 5660 Rel wrel 5663 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-11 2197 ax-12 2216 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-iota 6520 df-fun 6568 df-fn 6569 df-fv 6574 df-ov 7454 df-frecs 8337 |
| This theorem is used by: wfrrel 8376 |
| Copyright terms: Public domain | W3C validator |