| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > raleqi | Unicode version | ||
| Description: Equality inference for restricted universal qualifier. (Contributed by Paul Chapman, 22-Jun-2011.) |
| Ref | Expression |
|---|---|
| raleq1i.1 |
|
| Ref | Expression |
|---|---|
| raleqi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | raleq1i.1 |
. 2
| |
| 2 | raleq 2743 |
. 2
| |
| 3 | 1, 2 | ax-mp 5 |
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-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 |
| This theorem is referenced by: ralrab2 2985 ralprg 3746 raltpg 3748 omsinds 4751 ralxp 4905 ralrnmpo 6178 nnnninfeq2 7435 fzprval 10443 fztpval 10444 infssuzex 10620 seq3f1olemp 10906 hashfibc 11237 zsumdc 12101 zproddc 12296 2prm 12855 xpsfrnel 13614 nninfsellemdc 16930 nninfsellemsuc 16932 |
| Copyright terms: Public domain | W3C validator |