Theorem trcleq2lemRP 43907

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

Assertion

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

Proof of Theorem trcleq2lemRP

Step	Hyp	Ref	Expression
1		id 22	. . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
2	1, 1	coeq12d 5814	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∘ 𝐴) = (𝐵 ∘ 𝐵))
3	2, 1	sseq12d 3968	. 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∘ 𝐴) ⊆ 𝐴 ↔ (𝐵 ∘ 𝐵) ⊆ 𝐵))
4	3	cleq2lem 43885	1 ⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ⊆ wss 3902   ∘ ccom 5629

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-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ss 3919  df-br 5100  df-opab 5162  df-co 5634

This theorem is referenced by: (None)