| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > frrlem6 | Structured version Visualization version Unicode version | ||
| Description: Lemma for founded recursion. The union of all acceptable functions is a relationship. (Contributed by Paul Chapman, 21-Apr-2012.) |
| Ref | Expression |
|---|---|
| frrlem6.1 |
|
| frrlem6.2 |
|
| Ref | Expression |
|---|---|
| frrlem6 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frrlem6.2 |
. 2
| |
| 2 | reluni 5241 |
. . . 4
| |
| 3 | frrlem6.1 |
. . . . . 6
| |
| 4 | 3 | frrlem2 31781 |
. . . . 5
|
| 5 | funrel 5905 |
. . . . 5
| |
| 6 | 4, 5 | syl 17 |
. . . 4
|
| 7 | 2, 6 | mprgbir 2927 |
. . 3
|
| 8 | releq 5201 |
. . 3
| |
| 9 | 7, 8 | mpbiri 248 |
. 2
|
| 10 | 1, 9 | ax-mp 5 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-iota 5851 df-fun 5890 df-fn 5891 df-fv 5896 df-ov 6653 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |