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 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 1461 | . . . 4 | |
4 | 2, 3 | nfan 1497 | . . 3 |
5 | 2ralbida.3 | . . . 4 | |
6 | 5 | anassrs 392 | . . 3 |
7 | 4, 6 | ralbida 2362 | . 2 |
8 | 1, 7 | ralbida 2362 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wnf 1389 wcel 1433 wral 2348 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-gen 1378 ax-4 1440 ax-17 1459 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-ral 2353 |
This theorem is referenced by: 2ralbidva 2388 |
Copyright terms: Public domain | W3C validator |