| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rexbidva | Structured version Visualization version Unicode version | ||
| Description: Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 9-Mar-1997.) Reduce dependencies on axioms. (Revised by Wolf Lammen, 6-Dec-2019.) (Proof shortened by Wolf Lammen, 10-Dec-2019.) |
| Ref | Expression |
|---|---|
| rexbidva.1 |
|
| Ref | Expression |
|---|---|
| rexbidva |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexbidva.1 |
. . 3
| |
| 2 | 1 | pm5.32da 673 |
. 2
|
| 3 | 2 | rexbidv2 3048 |
1
|
| Copyright terms: Public domain | W3C validator |