Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 2ralbidva | Unicode version |
Description: Formula-building rule for restricted universal quantifiers (deduction rule). (Contributed by NM, 4-Mar-1997.) |
Ref | Expression |
---|---|
2ralbidva.1 |
Ref | Expression |
---|---|
2ralbidva |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1421 | . 2 | |
2 | nfv 1421 | . 2 | |
3 | 2ralbidva.1 | . 2 | |
4 | 1, 2, 3 | 2ralbida 2345 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wcel 1393 wral 2306 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-gen 1338 ax-4 1400 ax-17 1419 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-ral 2311 |
This theorem is referenced by: soinxp 4410 isotr 5456 |
Copyright terms: Public domain | W3C validator |