| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tfr2a | Unicode version | ||
| Description: A weak version of transfinite recursion. (Contributed by Mario Carneiro, 24-Jun-2015.) |
| Ref | Expression |
|---|---|
| tfr.1 |
|
| Ref | Expression |
|---|---|
| tfr2a |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 |
. . . 4
| |
| 2 | 1 | tfrlem9 6484 |
. . 3
|
| 3 | tfr.1 |
. . . 4
| |
| 4 | 3 | dmeqi 4932 |
. . 3
|
| 5 | 2, 4 | eleq2s 2326 |
. 2
|
| 6 | 3 | fveq1i 5640 |
. 2
|
| 7 | 3 | reseq1i 5009 |
. . 3
|
| 8 | 7 | fveq2i 5642 |
. 2
|
| 9 | 5, 6, 8 | 3eqtr4g 2289 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-setind 4635 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-res 4737 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 df-recs 6470 |
| This theorem is referenced by: tfr0 6488 tfri2d 6501 tfrcl 6529 tfri2 6531 frecsuclem 6571 |
| Copyright terms: Public domain | W3C validator |