Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 2ralbida | Unicode version |
Description: Formula-building rule for restricted universal quantifier (deduction form). (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 1526 | . . . 4 | |
4 | 2, 3 | nfan 1563 | . . 3 |
5 | 2ralbida.3 | . . . 4 | |
6 | 5 | anassrs 400 | . . 3 |
7 | 4, 6 | ralbida 2469 | . 2 |
8 | 1, 7 | ralbida 2469 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 104 wb 105 wnf 1458 wcel 2146 wral 2453 |
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 1445 ax-gen 1447 ax-4 1508 ax-17 1524 |
This theorem depends on definitions: df-bi 117 df-nf 1459 df-ral 2458 |
This theorem is referenced by: 2ralbidva 2497 |
Copyright terms: Public domain | W3C validator |