| 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 5650 |
. . . . . . . . . 10
|
| 3 | 2 | eleq2d 2301 |
. . . . . . . . 9
|
| 4 | 3 | anbi2d 464 |
. . . . . . . 8
|
| 5 | 4 | rexbidv 2534 |
. . . . . . 7
|
| 6 | 5 | orbi1d 799 |
. . . . . 6
|
| 7 | 6 | abbidv 2350 |
. . . . 5
|
| 8 | 7 | mpteq2dva 4184 |
. . . 4
|
| 9 | recseq 6515 |
. . . 4
| |
| 10 | 8, 9 | syl 14 |
. . 3
|
| 11 | 10 | reseq1d 5018 |
. 2
|
| 12 | df-frec 6600 |
. 2
| |
| 13 | df-frec 6600 |
. 2
| |
| 14 | 11, 12, 13 | 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-in 3207 df-uni 3899 df-br 4094 df-opab 4156 df-mpt 4157 df-res 4743 df-iota 5293 df-fv 5341 df-recs 6514 df-frec 6600 |
| This theorem is referenced by: frecuzrdgdom 10743 frecuzrdgfun 10745 frecuzrdgsuct 10749 seqeq1 10775 seqeq2 10776 seqeq3 10777 iseqvalcbv 10784 hashfz1 11108 ennnfonelemr 13124 ctinfom 13129 isomninn 16763 iswomninn 16783 ismkvnn 16786 |
| Copyright terms: Public domain | W3C validator |