| 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 2749 |
. 2
| |
| 3 | 1, 2 | ax-mp 5 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 |
| This theorem is used by: ralrab2 2991 ralprg 3760 raltpg 3762 omsinds 4769 ralxp 4923 ralrnmpo 6203 nnnninfeq2 7470 fzprval 10500 fztpval 10501 infssuzex 10677 seq3f1olemp 10967 hashfibc 11299 zsumdc 12170 zproddc 12365 2prm 12924 xpsfrnel 13718 nninfsellemdc 17219 nninfsellemsuc 17221 |
| Copyright terms: Public domain | W3C validator |