| 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 3929 iineq1 3982 bnd2 4261 frforeq2 4440 weeq2 4452 ordeq 4467 reg2exmid 4632 reg3exmid 4676 omsinds 4718 fncnv 5393 funimaexglem 5410 isoeq4 5940 acexmidlemv 6011 tfrlem1 6469 tfr0dm 6483 tfrlemisucaccv 6486 tfrlemi1 6493 tfrlemi14d 6494 tfrexlem 6495 tfr1onlemsucaccv 6502 tfr1onlemaccex 6509 tfr1onlemres 6510 tfrcllemsucaccv 6515 tfrcllembxssdm 6517 tfrcllemaccex 6522 tfrcllemres 6523 tfrcldm 6524 ixpeq1 6873 ac6sfi 7080 fimax2gtri 7084 dcfi 7171 supeq1 7176 supeq2 7179 nnnninfeq2 7319 isomni 7326 ismkv 7343 iswomni 7355 acneq 7407 tapeq2 7462 sup3exmid 9127 rexanuz 11539 rexfiuz 11540 fimaxre2 11778 modfsummod 12009 mhmpropd 13539 isghm 13820 iscmn 13870 srgideu 13975 dfrhm2 14158 cnprcl2k 14920 ispsmet 15037 ismet 15058 isxmet 15059 cncfval 15286 dvcn 15414 setindis 16498 bdsetindis 16500 strcoll2 16514 strcollnfALT 16517 |
| Copyright terms: Public domain | W3C validator |