| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trcleq2lem | Structured version Visualization version GIF version | ||
| Description: Equality implies bijection. (Contributed by RP, 5-May-2020.) |
| Ref | Expression |
|---|---|
| trcleq2lem | ⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq2 3938 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 ⊆ 𝐴 ↔ 𝑅 ⊆ 𝐵)) | |
| 2 | id 23 | . . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵) | |
| 3 | 2, 2 | coeq12d 5846 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∘ 𝐴) = (𝐵 ∘ 𝐵)) |
| 4 | 3, 2 | sseq12d 3945 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∘ 𝐴) ⊆ 𝐴 ↔ (𝐵 ∘ 𝐵) ⊆ 𝐵)) |
| 5 | 1, 4 | anbi12d 644 | 1 ⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ⊆ wss 3899 ∘ ccom 5658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-ss 3900 df-br 5106 df-opab 5170 df-co 5663 |
| This theorem is used by: cvbtrcl 15157 trcleq12lem 15158 trclublem 15160 cotrtrclfv 15177 trclun 15179 trclexi 44760 dftrcl3 44860 |
| Copyright terms: Public domain | W3C validator |