MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  trcleq1 Structured version   Visualization version   GIF version

Theorem trcleq1 14337
Description: Equality of relations implies equality of transitive closures. (Contributed by RP, 9-May-2020.)
Assertion
Ref Expression
trcleq1 (𝑅 = 𝑆 {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} = {𝑟 ∣ (𝑆𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
Distinct variable groups:   𝑅,𝑟   𝑆,𝑟

Proof of Theorem trcleq1
StepHypRef Expression
1 cleq1 14331 1 (𝑅 = 𝑆 {𝑟 ∣ (𝑅𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)} = {𝑟 ∣ (𝑆𝑟 ∧ (𝑟𝑟) ⊆ 𝑟)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1528  {cab 2796  wss 3933   cint 4867  ccom 5552
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-ral 3140  df-in 3940  df-ss 3949  df-int 4868
This theorem is referenced by:  trclfv  14348
  Copyright terms: Public domain W3C validator