| 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 5641 |
. . . . . . . . . 10
|
| 3 | 2 | eleq2d 2301 |
. . . . . . . . 9
|
| 4 | 3 | anbi2d 464 |
. . . . . . . 8
|
| 5 | 4 | rexbidv 2533 |
. . . . . . 7
|
| 6 | 5 | orbi1d 798 |
. . . . . 6
|
| 7 | 6 | abbidv 2349 |
. . . . 5
|
| 8 | 7 | mpteq2dva 4179 |
. . . 4
|
| 9 | recseq 6471 |
. . . 4
| |
| 10 | 8, 9 | syl 14 |
. . 3
|
| 11 | 10 | reseq1d 5012 |
. 2
|
| 12 | df-frec 6556 |
. 2
| |
| 13 | df-frec 6556 |
. 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 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-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-in 3206 df-uni 3894 df-br 4089 df-opab 4151 df-mpt 4152 df-res 4737 df-iota 5286 df-fv 5334 df-recs 6470 df-frec 6556 |
| This theorem is referenced by: frecuzrdgdom 10679 frecuzrdgfun 10681 frecuzrdgsuct 10685 seqeq1 10711 seqeq2 10712 seqeq3 10713 iseqvalcbv 10720 hashfz1 11044 ennnfonelemr 13043 ctinfom 13048 isomninn 16635 iswomninn 16654 ismkvnn 16657 |
| Copyright terms: Public domain | W3C validator |