| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > freceq1 | Unicode version | ||
| Description: Equality theorem for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.) |
| Ref | Expression |
|---|---|
| freceq1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 |
. . . . . . . . . . 11
| |
| 2 | 1 | fveq1d 5601 |
. . . . . . . . . 10
|
| 3 | 2 | eleq2d 2277 |
. . . . . . . . 9
|
| 4 | 3 | anbi2d 464 |
. . . . . . . 8
|
| 5 | 4 | rexbidv 2509 |
. . . . . . 7
|
| 6 | 5 | orbi1d 793 |
. . . . . 6
|
| 7 | 6 | abbidv 2325 |
. . . . 5
|
| 8 | 7 | mpteq2dva 4150 |
. . . 4
|
| 9 | recseq 6415 |
. . . 4
| |
| 10 | 8, 9 | syl 14 |
. . 3
|
| 11 | 10 | reseq1d 4977 |
. 2
|
| 12 | df-frec 6500 |
. 2
| |
| 13 | df-frec 6500 |
. 2
| |
| 14 | 11, 12, 13 | 3eqtr4g 2265 |
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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-v 2778 df-in 3180 df-uni 3865 df-br 4060 df-opab 4122 df-mpt 4123 df-res 4705 df-iota 5251 df-fv 5298 df-recs 6414 df-frec 6500 |
| This theorem is referenced by: frecuzrdgdom 10600 frecuzrdgfun 10602 frecuzrdgsuct 10606 seqeq1 10632 seqeq2 10633 seqeq3 10634 iseqvalcbv 10641 hashfz1 10965 ennnfonelemr 12909 ctinfom 12914 isomninn 16172 iswomninn 16191 ismkvnn 16194 |
| Copyright terms: Public domain | W3C validator |