| 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 38774 | . . 3 ⊢ (𝑅 = 𝑆 → ( RefRel 𝑅 ↔ RefRel 𝑆)) | |
| 2 | symreleq 38815 | . . 3 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) | |
| 3 | trreleq 38839 | . . 3 ⊢ (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆)) | |
| 4 | 1, 2, 3 | 3anbi123d 1438 | . 2 ⊢ (𝑅 = 𝑆 → (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆))) |
| 5 | df-eqvrel 38842 | . 2 ⊢ ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅)) | |
| 6 | df-eqvrel 38842 | . 2 ⊢ ( EqvRel 𝑆 ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆)) | |
| 7 | 4, 5, 6 | 3bitr4g 314 | 1 ⊢ (𝑅 = 𝑆 → ( EqvRel 𝑅 ↔ EqvRel 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1541 RefRel wrefrel 38389 SymRel wsymrel 38395 TrRel wtrrel 38398 EqvRel weqvrel 38400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-refrel 38765 df-symrel 38797 df-trrel 38831 df-eqvrel 38842 |
| This theorem is referenced by: eqvreleqi 38860 eqvreleqd 38861 erALTVeq1 38928 |
| Copyright terms: Public domain | W3C validator |