| 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 5692 |
. . . . . . . . . 10
|
| 3 | 2 | eleq2d 2308 |
. . . . . . . . 9
|
| 4 | 3 | anbi2d 468 |
. . . . . . . 8
|
| 5 | 4 | rexbidv 2551 |
. . . . . . 7
|
| 6 | 5 | orbi1d 803 |
. . . . . 6
|
| 7 | 6 | abbidv 2358 |
. . . . 5
|
| 8 | 7 | mpteq2dva 4216 |
. . . 4
|
| 9 | recseq 6567 |
. . . 4
| |
| 10 | 8, 9 | syl 14 |
. . 3
|
| 11 | 10 | reseq1d 5057 |
. 2
|
| 12 | df-frec 6652 |
. 2
| |
| 13 | df-frec 6652 |
. 2
| |
| 14 | 11, 12, 13 | 3eqtr4g 2296 |
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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-in 3226 df-uni 3931 df-br 4126 df-opab 4188 df-mpt 4189 df-res 4781 df-iota 5332 df-fv 5380 df-recs 6566 df-frec 6652 |
| This theorem is referenced by: frecuzrdgdom 10833 frecuzrdgfun 10835 frecuzrdgsuct 10839 seqeq1 10865 seqeq2 10866 seqeq3 10867 iseqvalcbv 10874 hashfz1 11200 ennnfonelemr 13292 ctinfom 13297 isomninn 16985 iswomninn 17005 ismkvnn 17008 |
| Copyright terms: Public domain | W3C validator |