| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > raleq | GIF version | ||
| Description: Equality theorem for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.) |
| Ref | Expression |
|---|---|
| raleq | ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2375 | . 2 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2375 | . 2 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | raleqf 2727 | 1 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∀wral 2511 |
| 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 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 |
| This theorem is referenced by: raleqi 2735 raleqdv 2737 raleqbi1dv 2743 sbralie 2786 inteq 3936 iineq1 3989 bnd2 4269 frforeq2 4448 weeq2 4460 ordeq 4475 reg2exmid 4640 reg3exmid 4684 omsinds 4726 fncnv 5403 funimaexglem 5420 isoeq4 5955 acexmidlemv 6026 tfrlem1 6517 tfr0dm 6531 tfrlemisucaccv 6534 tfrlemi1 6541 tfrlemi14d 6542 tfrexlem 6543 tfr1onlemsucaccv 6550 tfr1onlemaccex 6557 tfr1onlemres 6558 tfrcllemsucaccv 6563 tfrcllembxssdm 6565 tfrcllemaccex 6570 tfrcllemres 6571 tfrcldm 6572 ixpeq1 6921 ac6sfi 7130 fimax2gtri 7134 dcfi 7223 supeq1 7228 supeq2 7231 nnnninfeq2 7371 isomni 7378 ismkv 7395 iswomni 7407 acneq 7460 tapeq2 7515 sup3exmid 9179 rexanuz 11611 rexfiuz 11612 fimaxre2 11850 modfsummod 12082 mhmpropd 13612 isghm 13893 iscmn 13943 srgideu 14049 dfrhm2 14232 cnprcl2k 15000 ispsmet 15117 ismet 15138 isxmet 15139 cncfval 15366 dvcn 15494 setindis 16666 bdsetindis 16668 strcoll2 16682 strcollnfALT 16685 |
| Copyright terms: Public domain | W3C validator |