| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > riotabidv | Unicode version | ||
| Description: Formula-building deduction for restricted iota. (Contributed by NM, 15-Sep-2011.) |
| Ref | Expression |
|---|---|
| riotabidv.1 |
|
| Ref | Expression |
|---|---|
| riotabidv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | biidd 172 |
. . . 4
| |
| 2 | riotabidv.1 |
. . . 4
| |
| 3 | 1, 2 | anbi12d 477 |
. . 3
|
| 4 | 3 | iotabidv 5360 |
. 2
|
| 5 | df-riota 6038 |
. 2
| |
| 6 | df-riota 6038 |
. 2
| |
| 7 | 4, 5, 6 | 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-rex 2534 df-uni 3936 df-iota 5337 df-riota 6038 |
| This theorem is used by: riotaeqbidv 6041 csbriotag 6052 infvalti 7362 caucvgsrlemfv 8158 axcaucvglemval 8264 axcaucvglemcau 8265 subval 8518 divvalap 9004 divfnzn 10021 flval 10707 cjval 11610 sqrtrval 11766 qnumval 12963 qdenval 12964 grpinvval 13848 uspgredg2v 16462 usgredg2v 16465 |
| Copyright terms: Public domain | W3C validator |