Theorem trcleq2lem 15144

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

Assertion

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

Proof of Theorem trcleq2lem

Step	Hyp	Ref	Expression
1		sseq2 3957	. 2 ⊢ (𝐴 = 𝐵 → (𝑅 ⊆ 𝐴 ↔ 𝑅 ⊆ 𝐵))
2		id 23	. . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
3	2, 2	coeq12d 5842	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∘ 𝐴) = (𝐵 ∘ 𝐵))
4	3, 2	sseq12d 3964	. 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∘ 𝐴) ⊆ 𝐴 ↔ (𝐵 ∘ 𝐵) ⊆ 𝐵))
5	1, 4	anbi12d 644	1 ⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ⊆ wss 3899   ∘ 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-8 2147  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-clel 2836  df-ss 3916  df-br 5104  df-opab 5168  df-co 5660

This theorem is used by:  cvbtrcl  15145  trcleq12lem  15146  trclublem  15148  cotrtrclfv  15165  trclun  15167  trclexi  44619  dftrcl3  44719