| 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 2384 | . 2 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfcv 2384 | . 2 ⊢ Ⅎ𝑥𝐵 | |
| 3 | 1, 2 | raleqf 2737 | 1 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∀wral 2520 |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 |
| This theorem is referenced by: raleqi 2745 raleqdv 2747 raleqbi1dv 2753 sbralie 2796 inteq 3952 iineq1 4005 bnd2 4286 frforeq2 4466 weeq2 4478 ordeq 4493 reg2exmid 4658 reg3exmid 4702 omsinds 4744 fncnv 5422 funimaexglem 5439 isoeq4 5977 acexmidlemv 6048 tfrlem1 6539 tfr0dm 6553 tfrlemisucaccv 6556 tfrlemi1 6563 tfrlemi14d 6564 tfrexlem 6565 tfr1onlemsucaccv 6572 tfr1onlemaccex 6579 tfr1onlemres 6580 tfrcllemsucaccv 6585 tfrcllembxssdm 6587 tfrcllemaccex 6592 tfrcllemres 6593 tfrcldm 6594 ixpeq1 6944 ac6sfi 7155 fimax2gtri 7159 dcfi 7268 supeq1 7277 supeq2 7280 nnnninfeq2 7420 isomni 7427 ismkv 7444 iswomni 7456 acneq 7509 tapeq2 7567 sup3exmid 9231 rexanuz 11673 rexfiuz 11674 fimaxre2 11912 modfsummod 12144 mhmpropd 13679 isghm 13960 iscmn 14010 srgideu 14116 dfrhm2 14299 cnprcl2k 15071 ispsmet 15188 ismet 15209 isxmet 15210 cncfval 15437 dvcn 15565 setindis 16737 bdsetindis 16739 strcoll2 16753 strcollnfALT 16756 |
| Copyright terms: Public domain | W3C validator |