Users' Mathboxes Mathbox for Matthew House < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ttceq Structured version   Visualization version   GIF version

Theorem ttceq 36676
Description: Equality theorem for transitive closure. (Contributed by Matthew House, 6-Apr-2026.)
Assertion
Ref Expression
ttceq (𝐴 = 𝐵 → TC+ 𝐴 = TC+ 𝐵)

Proof of Theorem ttceq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 iuneq1 4951 . 2 (𝐴 = 𝐵 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω) = 𝑥𝐵 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω))
2 df-ttc 36675 . 2 TC+ 𝐴 = 𝑥𝐴 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
3 df-ttc 36675 . 2 TC+ 𝐵 = 𝑥𝐵 (rec((𝑦 ∈ V ↦ 𝑦), {𝑥}) “ ω)
41, 2, 33eqtr4g 2797 1 (𝐴 = 𝐵 → TC+ 𝐴 = TC+ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  Vcvv 3430  {csn 4568   cuni 4851   ciun 4934  cmpt 5167  cima 5625  ωcom 7808  reccrdg 8339  TC+ cttc 36674
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rex 3063  df-v 3432  df-ss 3907  df-iun 4936  df-ttc 36675
This theorem is referenced by:  ttceqi  36677  ttceqd  36678  ttc00  36696  ttciunun  36699  ttcsng  36707
  Copyright terms: Public domain W3C validator