| 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 39250 | . . 3 ⊢ (𝑅 = 𝑆 → ( RefRel 𝑅 ↔ RefRel 𝑆)) | |
| 2 | symreleq 39291 | . . 3 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) | |
| 3 | trreleq 39315 | . . 3 ⊢ (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆)) | |
| 4 | 1, 2, 3 | 3anbi123d 1464 | . 2 ⊢ (𝑅 = 𝑆 → (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆))) |
| 5 | df-eqvrel 39318 | . 2 ⊢ ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅)) | |
| 6 | df-eqvrel 39318 | . 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 1103 = wceq 1570 RefRel wrefrel 38838 SymRel wsymrel 38844 TrRel wtrrel 38847 EqvRel weqvrel 38849 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-refrel 39241 df-symrel 39273 df-trrel 39307 df-eqvrel 39318 |
| This theorem is referenced by: eqvreleqi 39336 eqvreleqd 39337 erALTVeq1 39403 |
| Copyright terms: Public domain | W3C validator |