| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eqvreleq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for equivalence relation. (Contributed by Peter Mazsa, 19-Apr-2020.) (Revised by Peter Mazsa, 23-Sep-2021.) |
| Ref | Expression |
|---|---|
| eqvreleq | ⊢ (𝑅 = 𝑆 → ( EqvRel 𝑅 ↔ EqvRel 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | refreleq 39135 | . . 3 ⊢ (𝑅 = 𝑆 → ( RefRel 𝑅 ↔ RefRel 𝑆)) | |
| 2 | symreleq 39176 | . . 3 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) | |
| 3 | trreleq 39200 | . . 3 ⊢ (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆)) | |
| 4 | 1, 2, 3 | 3anbi123d 1462 | . 2 ⊢ (𝑅 = 𝑆 → (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆))) |
| 5 | df-eqvrel 39203 | . 2 ⊢ ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅)) | |
| 6 | df-eqvrel 39203 | . 2 ⊢ ( EqvRel 𝑆 ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆)) | |
| 7 | 4, 5, 6 | 3bitr4g 317 | 1 ⊢ (𝑅 = 𝑆 → ( EqvRel 𝑅 ↔ EqvRel 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1101 = wceq 1567 RefRel wrefrel 38723 SymRel wsymrel 38729 TrRel wtrrel 38732 EqvRel weqvrel 38734 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5258 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5175 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-refrel 39126 df-symrel 39158 df-trrel 39192 df-eqvrel 39203 |
| This theorem is referenced by: eqvreleqi 39221 eqvreleqd 39222 erALTVeq1 39288 |
| Copyright terms: Public domain | W3C validator |