Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralbid | Unicode version |
Description: Formula-building rule for restricted universal quantifier (deduction form). (Contributed by NM, 27-Jun-1998.) |
Ref | Expression |
---|---|
ralbid.1 | |
ralbid.2 |
Ref | Expression |
---|---|
ralbid |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralbid.1 | . 2 | |
2 | ralbid.2 | . . 3 | |
3 | 2 | adantr 274 | . 2 |
4 | 1, 3 | ralbida 2458 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1447 wcel 2135 wral 2442 |
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 1434 ax-gen 1436 ax-4 1497 |
This theorem depends on definitions: df-bi 116 df-nf 1448 df-ral 2447 |
This theorem is referenced by: ralbidv 2464 sbcralt 3022 riota5f 5816 mkvprop 7113 lble 8833 ellimc3apf 13176 strcollnft 13707 |
Copyright terms: Public domain | W3C validator |