Theorem trcleq1 15135

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

Step	Hyp	Ref	Expression
1		cleq1 15129	1 ⊢ (𝑅 = 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} = ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  {cab 2739   ⊆ wss 3899  ∩ cint 4907   ∘ ccom 5655

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-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-ral 3078  df-rex 3088  df-ss 3916  df-int 4908

This theorem is used by:  trclfv  15146