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 2408 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1421 wcel 1465 wral 2393 |
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 1408 ax-gen 1410 ax-4 1472 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-ral 2398 |
This theorem is referenced by: ralbidv 2414 sbcralt 2957 riota5f 5722 mkvprop 7000 lble 8673 ellimc3apf 12725 |
Copyright terms: Public domain | W3C validator |