![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cleq1lem | Structured version Visualization version GIF version |
Description: Equality implies bijection. (Contributed by RP, 9-May-2020.) |
Ref | Expression |
---|---|
cleq1lem | ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sseq1 4021 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
2 | 1 | anbi1d 631 | 1 ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ⊆ wss 3963 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-9 2116 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1777 df-cleq 2727 df-ss 3980 |
This theorem is referenced by: cleq1 15019 trcleq12lem 15029 lcmfun 16679 coprmproddvds 16697 isslw 19641 neival 23126 nrmsep3 23379 xkococnlem 23683 ovolval 25522 ovnval2b 46508 |
Copyright terms: Public domain | W3C validator |