Theorem ttceq 36943

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 4972	. 2 ⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω) = ∪ 𝑥 ∈ 𝐵 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω))
2		df-ttc 36942	. 2 ⊢ TC+ 𝐴 = ∪ 𝑥 ∈ 𝐴 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω)
3		df-ttc 36942	. 2 ⊢ TC+ 𝐵 = ∪ 𝑥 ∈ 𝐵 ∪ (rec((𝑦 ∈ V ↦ ∪ 𝑦), {𝑥}) “ ω)
4	1, 2, 3	3eqtr4g 2821	1 ⊢ (𝐴 = 𝐵 → TC+ 𝐴 = TC+ 𝐵)

Syntax hints:   → wi 4   = wceq 1568  Vcvv 3453  {csn 4588  ∪ cuni 4871  ∪ ciun 4955   ↦ cmpt 5191   “ cima 5664  ωcom 7861  reccrdg 8395  TC+ cttc 36941

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-rex 3088  df-v 3455  df-ss 3921  df-iun 4957  df-ttc 36942

This theorem is referenced by:  ttceqi  36944  ttceqd  36945  ttc00  36963  ttciunun  36966  ttcsng  36974