| 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 2372 | . 2 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2372 | . 2 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | raleqf 2724 | 1 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1395 ∀wral 2508 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 |
| This theorem is referenced by: raleqi 2732 raleqdv 2734 raleqbi1dv 2740 sbralie 2783 inteq 3926 iineq1 3979 bnd2 4257 frforeq2 4436 weeq2 4448 ordeq 4463 reg2exmid 4628 reg3exmid 4672 omsinds 4714 fncnv 5387 funimaexglem 5404 isoeq4 5934 acexmidlemv 6005 tfrlem1 6460 tfr0dm 6474 tfrlemisucaccv 6477 tfrlemi1 6484 tfrlemi14d 6485 tfrexlem 6486 tfr1onlemsucaccv 6493 tfr1onlemaccex 6500 tfr1onlemres 6501 tfrcllemsucaccv 6506 tfrcllembxssdm 6508 tfrcllemaccex 6513 tfrcllemres 6514 tfrcldm 6515 ixpeq1 6864 ac6sfi 7068 fimax2gtri 7072 dcfi 7159 supeq1 7164 supeq2 7167 nnnninfeq2 7307 isomni 7314 ismkv 7331 iswomni 7343 acneq 7395 tapeq2 7450 sup3exmid 9115 rexanuz 11514 rexfiuz 11515 fimaxre2 11753 modfsummod 11984 mhmpropd 13514 isghm 13795 iscmn 13845 srgideu 13950 dfrhm2 14133 cnprcl2k 14895 ispsmet 15012 ismet 15033 isxmet 15034 cncfval 15261 dvcn 15389 setindis 16385 bdsetindis 16387 strcoll2 16401 strcollnfALT 16404 |
| Copyright terms: Public domain | W3C validator |