| 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 3961 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
| 2 | 1 | anbi1d 640 | 1 ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ⊆ wss 3904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-cleq 2753 df-ss 3921 |
| This theorem is referenced by: cleq1 14993 trcleq12lem 15003 lcmfun 16662 coprmproddvds 16680 isslw 19631 neival 23142 nrmsep3 23395 xkococnlem 23699 ovolval 25515 tz9.1regs 35394 ovnval2b 47090 |
| Copyright terms: Public domain | W3C validator |