Theorem ttceq 37198

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.

Step	Hyp	Ref	Expression
1		iuneq1 4967	. 2 ⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω) = ∪ 𝑥 ∈ 𝐵 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω))
2		df-ttc 37197	. 2 ⊢ TC+ 𝐴 = ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω)
3		df-ttc 37197	. 2 ⊢ TC+ 𝐵 = ∪ 𝑥 ∈ 𝐵 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω)
4	1, 2, 3	3eqtr4g 2820	1 ⊢ (𝐴 = 𝐵 → TC+ 𝐴 = TC+ 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570  Vcvv 3450  {csn 4583  ∪ cuni 4866  ∪ ciun 4950   ↦ cmpt 5185   “ cima 5650  ωcom 7860  reccrdg 8395  TC+ cttc 37196

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 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-v 3452  df-ss 3915  df-iun 4952  df-ttc 37197

This theorem is used by:  ttceqi  37199  ttceqd  37200  ttc00  37218  ttciunun  37221  ttcsng  37229