Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ralbidv2 | Structured version Visualization version Unicode version |
Description: Formula-building rule for restricted universal quantifier (deduction rule). (Contributed by NM, 6-Apr-1997.) |
Ref | Expression |
---|---|
ralbidv2.1 |
Ref | Expression |
---|---|
ralbidv2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralbidv2.1 | . . 3 | |
2 | 1 | albidv 1849 | . 2 |
3 | df-ral 2917 | . 2 | |
4 | df-ral 2917 | . 2 | |
5 | 2, 3, 4 | 3bitr4g 303 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wal 1481 wcel 1990 wral 2912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 |
This theorem depends on definitions: df-bi 197 df-ral 2917 |
This theorem is referenced by: ralbidva 2985 ralss 3668 oneqmini 5776 ordunisuc2 7044 dfsmo2 7444 wemapsolem 8455 zorn2lem1 9318 raluz 11736 limsupgle 14208 ello12 14247 elo12 14258 lo1resb 14295 rlimresb 14296 o1resb 14297 isprm3 15396 isprm7 15420 ist1 21125 ist1-2 21151 hausdiag 21448 xkopt 21458 cnflf 21806 cnfcf 21846 metcnp 22346 caucfil 23081 mdegleb 23824 eulerpartlemgvv 30438 filnetlem4 32376 hoidmvle 40814 elbigo2 42346 |
Copyright terms: Public domain | W3C validator |