| 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 3947 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
| 2 | 1 | anbi1d 632 | 1 ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ⊆ wss 3889 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-9 2124 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1782 df-cleq 2728 df-ss 3906 |
| This theorem is referenced by: cleq1 14945 trcleq12lem 14955 lcmfun 16614 coprmproddvds 16632 isslw 19583 neival 23067 nrmsep3 23320 xkococnlem 23624 ovolval 25440 tz9.1regs 35278 ovnval2b 46980 |
| Copyright terms: Public domain | W3C validator |