Theorem trcleq2lem 15033

Description: Equality implies bijection. (Contributed by RP, 5-May-2020.)

Assertion

Ref	Expression
trcleq2lem	⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵)))

Proof of Theorem trcleq2lem

Step	Hyp	Ref	Expression
1		sseq2 3963	. 2 ⊢ (𝐴 = 𝐵 → (𝑅 ⊆ 𝐴 ↔ 𝑅 ⊆ 𝐵))
2		id 23	. . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
3	2, 2	coeq12d 5850	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∘ 𝐴) = (𝐵 ∘ 𝐵))
4	3, 2	sseq12d 3970	. 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∘ 𝐴) ⊆ 𝐴 ↔ (𝐵 ∘ 𝐵) ⊆ 𝐵))
5	1, 4	anbi12d 643	1 ⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ⊆ wss 3905   ∘ ccom 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ss 3922  df-br 5110  df-opab 5174  df-co 5670

This theorem is used by:  cvbtrcl  15034  trcleq12lem  15035  trclublem  15037  cotrtrclfv  15054  trclun  15056  trclexi  44374  dftrcl3  44474