| 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 3959 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
| 2 | 1 | anbi1d 631 | 1 ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ⊆ wss 3901 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-cleq 2728 df-ss 3918 |
| This theorem is referenced by: cleq1 14906 trcleq12lem 14916 lcmfun 16572 coprmproddvds 16590 isslw 19537 neival 23046 nrmsep3 23299 xkococnlem 23603 ovolval 25430 tz9.1regs 35290 ovnval2b 46792 |
| Copyright terms: Public domain | W3C validator |