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 36544 | . . 3 ⊢ (𝑅 = 𝑆 → ( RefRel 𝑅 ↔ RefRel 𝑆)) | |
2 | symreleq 36578 | . . 3 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) | |
3 | trreleq 36602 | . . 3 ⊢ (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆)) | |
4 | 1, 2, 3 | 3anbi123d 1438 | . 2 ⊢ (𝑅 = 𝑆 → (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆))) |
5 | df-eqvrel 36604 | . 2 ⊢ ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅)) | |
6 | df-eqvrel 36604 | . 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 1089 = wceq 1543 RefRel wrefrel 36245 SymRel wsymrel 36251 TrRel wtrrel 36254 EqvRel weqvrel 36256 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-12 2177 ax-ext 2710 ax-sep 5216 ax-nul 5223 ax-pr 5346 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-clab 2717 df-cleq 2731 df-clel 2818 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3425 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4255 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-xp 5585 df-rel 5586 df-cnv 5587 df-co 5588 df-dm 5589 df-rn 5590 df-res 5591 df-refrel 36536 df-symrel 36564 df-trrel 36594 df-eqvrel 36604 |
This theorem is referenced by: eqvreleqi 36622 eqvreleqd 36623 erALTVeq1 36687 |
Copyright terms: Public domain | W3C validator |