| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 2ralbidv | Unicode version | ||
| Description: Formula-building rule for restricted universal quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.) (Revised by Szymon Jaroszewicz, 16-Mar-2007.) |
| Ref | Expression |
|---|---|
| 2ralbidv.1 |
|
| Ref | Expression |
|---|---|
| 2ralbidv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2ralbidv.1 |
. . 3
| |
| 2 | 1 | ralbidv 2544 |
. 2
|
| 3 | 2 | ralbidv 2544 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1496 ax-gen 1498 ax-4 1559 ax-17 1575 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-ral 2527 |
| This theorem is referenced by: cbvral3v 2795 poeq1 4425 soeq1 4441 isoeq1 5980 isoeq2 5981 isoeq3 5982 fnmpoovd 6424 smoeq 6534 xpf1o 7110 papeq1 7573 papcotr 7577 tapeq1 7582 elinp 7805 cauappcvgpr 7993 seq3caopr2 10882 seqcaopr2g 10883 wrd2ind 11443 addcn2 12024 mulcn2 12026 sgrp1 13678 ismhm 13720 mhmex 13721 issubm 13731 isnsg 13959 nmznsg 13970 isghm 14000 iscmn 14050 ring1 14306 opprsubrngg 14461 issubrg3 14497 islmod 14569 lmodlema 14570 lsssetm 14634 islssmd 14637 islidlm 14757 ispsmet 15318 ismet 15339 isxmet 15340 addcncntoplem 15556 elcncf 15568 mpodvdsmulf1o 15988 |
| Copyright terms: Public domain | W3C validator |