| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rexbidv2 | Unicode version | ||
| Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 22-May-1999.) |
| Ref | Expression |
|---|---|
| rexbidv2.1 |
|
| Ref | Expression |
|---|---|
| rexbidv2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexbidv2.1 |
. . 3
| |
| 2 | 1 | exbidv 1878 |
. 2
|
| 3 | df-rex 2534 |
. 2
| |
| 4 | df-rex 2534 |
. 2
| |
| 5 | 2, 3, 4 | 3bitr4g 223 |
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-5 1500 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-4 1563 ax-17 1579 ax-ial 1587 |
| This proof depends on definitions: df-bi 117 df-rex 2534 |
| This theorem is used by: rexss 3315 isoini 6024 rexsupp 6493 elfi2 7306 ltexpi 7704 rexuz 9980 4sqexercise2 13178 4sqlemsdc 13179 sscoll2 17014 |
| Copyright terms: Public domain | W3C validator |