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 1521 | . . . 4 | |
4 | 2, 3 | nfan 1558 | . . 3 |
5 | 2ralbida.3 | . . . 4 | |
6 | 5 | anassrs 398 | . . 3 |
7 | 4, 6 | ralbida 2464 | . 2 |
8 | 1, 7 | ralbida 2464 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wnf 1453 wcel 2141 wral 2448 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1440 ax-gen 1442 ax-4 1503 ax-17 1519 |
This theorem depends on definitions: df-bi 116 df-nf 1454 df-ral 2453 |
This theorem is referenced by: 2ralbidva 2492 |
Copyright terms: Public domain | W3C validator |