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 39884
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 39799 . . 3 (𝑅 = 𝑆 → ( RefRel 𝑅 ↔ RefRel 𝑆))
2 symreleq 39840 . . 3 (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆))
3 trreleq 39864 . . 3 (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆))
41, 2, 33anbi123d 1465 . 2 (𝑅 = 𝑆 → (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ( RefRel 𝑆 ∧ SymRel 𝑆 ∧ TrRel 𝑆)))
5 df-eqvrel 39867 . 2 ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅))
6 df-eqvrel 39867 . 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 39387   SymRel wsymrel 39393   TrRel wtrrel 39396   EqvRel weqvrel 39398
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-refrel 39790  df-symrel 39822  df-trrel 39856  df-eqvrel 39867
This theorem is used by:  eqvreleqi  39885  eqvreleqd  39886  erALTVeq1  39952
  Copyright terms: Public domain W3C validator