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 form). (Contributed by NM, 4-Mar-1997.) |
Ref | Expression |
---|---|
2ralbidva.1 |
Ref | Expression |
---|---|
2ralbidva |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1508 | . 2 | |
2 | nfv 1508 | . 2 | |
3 | 2ralbidva.1 | . 2 | |
4 | 1, 2, 3 | 2ralbida 2454 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wcel 1480 wral 2414 |
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 1423 ax-gen 1425 ax-4 1487 ax-17 1506 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-ral 2419 |
This theorem is referenced by: soinxp 4604 isotr 5710 fnmpoovd 6105 ismet2 12512 txmetcn 12677 |
Copyright terms: Public domain | W3C validator |