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 3996 | . 2 ⊢ (𝐴 = 𝐵 → (𝑅 ⊆ 𝐴 ↔ 𝑅 ⊆ 𝐵)) | |
2 | id 22 | . . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵) | |
3 | 2, 2 | coeq12d 5738 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∘ 𝐴) = (𝐵 ∘ 𝐵)) |
4 | 3, 2 | sseq12d 4003 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐴 ∘ 𝐴) ⊆ 𝐴 ↔ (𝐵 ∘ 𝐵) ⊆ 𝐵)) |
5 | 1, 4 | anbi12d 632 | 1 ⊢ (𝐴 = 𝐵 → ((𝑅 ⊆ 𝐴 ∧ (𝐴 ∘ 𝐴) ⊆ 𝐴) ↔ (𝑅 ⊆ 𝐵 ∧ (𝐵 ∘ 𝐵) ⊆ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ⊆ wss 3939 ∘ ccom 5562 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-in 3946 df-ss 3955 df-br 5070 df-opab 5132 df-co 5567 |
This theorem is referenced by: cvbtrcl 14355 trcleq12lem 14356 trclublem 14358 cotrtrclfv 14375 trclun 14377 trclexi 39986 dftrcl3 40071 |
Copyright terms: Public domain | W3C validator |