Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eqvreleq Structured version   Visualization version   GIF version

Theorem eqvreleq 39598
Description: Equality theorem for equivalence relation. (Contributed by Peter Mazsa, 19-Apr-2020.) (Revised by Peter Mazsa, 23-Sep-2021.)
Assertion
Ref Expression
eqvreleq (𝑅 = 𝑆 → ( EqvRel 𝑅 ↔ EqvRel 𝑆))

Proof of Theorem eqvreleq
StepHypRef Expression
1 refreleq 39513 . . 3 (𝑅 = 𝑆 → ( RefRel 𝑅 ↔ RefRel 𝑆))
2 symreleq 39554 . . 3 (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆))
3 trreleq 39578 . . 3 (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆))
41, 2, 33anbi123d 1464 . 2 (𝑅 = 𝑆 → (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆)))
5 df-eqvrel 39581 . 2 ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅))
6 df-eqvrel 39581 . 2 ( EqvRel 𝑆 ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆))
74, 5, 63bitr4g 317 1 (𝑅 = 𝑆 → ( EqvRel 𝑅 ↔ EqvRel 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   RefRel wrefrel 39101   SymRel wsymrel 39107   TrRel wtrrel 39110   EqvRel weqvrel 39112
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-refrel 39504  df-symrel 39536  df-trrel 39570  df-eqvrel 39581
This theorem is used by:  eqvreleqi  39599  eqvreleqd  39600  erALTVeq1  39666
  Copyright terms: Public domain W3C validator