Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2ralbida | Structured version Visualization version Unicode version |
Description: Formula-building rule for restricted universal quantifier (deduction rule). (Contributed by NM, 24-Feb-2004.) |
Ref | Expression |
---|---|
2ralbida.1 | |
2ralbida.2 | |
2ralbida.3 |
Ref | Expression |
---|---|
2ralbida |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2ralbida.1 | . 2 | |
2 | 2ralbida.2 | . . . 4 | |
3 | nfv 1843 | . . . 4 | |
4 | 2, 3 | nfan 1828 | . . 3 |
5 | 2ralbida.3 | . . . 4 | |
6 | 5 | anassrs 680 | . . 3 |
7 | 4, 6 | ralbida 2982 | . 2 |
8 | 1, 7 | ralbida 2982 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wnf 1708 wcel 1990 wral 2912 |
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-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-ral 2917 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |