| 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 5697 |
. . . . . . . . . 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 4221 |
. . . 4
|
| 9 | recseq 6577 |
. . . 4
| |
| 10 | 8, 9 | syl 14 |
. . 3
|
| 11 | 10 | reseq1d 5062 |
. 2
|
| 12 | df-frec 6662 |
. 2
| |
| 13 | df-frec 6662 |
. 2
| |
| 14 | 11, 12, 13 | 3eqtr4g 2296 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on 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 proof 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 3936 df-br 4131 df-opab 4193 df-mpt 4194 df-res 4786 df-iota 5337 df-fv 5385 df-recs 6576 df-frec 6662 |
| This theorem is used by: frecuzrdgdom 10855 frecuzrdgfun 10857 frecuzrdgsuct 10861 seqeq1 10887 seqeq2 10888 seqeq3 10889 iseqvalcbv 10896 hashfz1 11222 ennnfonelemr 13314 ctinfom 13319 isomninn 17080 iswomninn 17100 ismkvnn 17103 |
| Copyright terms: Public domain | W3C validator |