| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rmobidva | Unicode version | ||
| Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.) |
| Ref | Expression |
|---|---|
| rmobidva.1 |
|
| Ref | Expression |
|---|---|
| rmobidva |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1574 |
. 2
| |
| 2 | rmobidva.1 |
. 2
| |
| 3 | 1, 2 | rmobida 2719 |
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-5 1493 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-4 1556 ax-17 1572 ax-ial 1580 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 df-eu 2080 df-mo 2081 df-rmo 2516 |
| This theorem is referenced by: rmobidv 2721 |
| Copyright terms: Public domain | W3C validator |