Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rmobida | Structured version Visualization version Unicode version |
Description: Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
rmobida.1 | |
rmobida.2 |
Ref | Expression |
---|---|
rmobida |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rmobida.1 | . . 3 | |
2 | rmobida.2 | . . . 4 | |
3 | 2 | pm5.32da 673 | . . 3 |
4 | 1, 3 | mobid 2489 | . 2 |
5 | df-rmo 2920 | . 2 | |
6 | df-rmo 2920 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 303 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wnf 1708 wcel 1990 wmo 2471 wrmo 2915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-12 2047 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-nf 1710 df-eu 2474 df-mo 2475 df-rmo 2920 |
This theorem is referenced by: rmobidva 3130 reuan 41180 |
Copyright terms: Public domain | W3C validator |