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 3994 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
2 | 1 | anbi1d 631 | 1 ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ⊆ wss 3938 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-in 3945 df-ss 3954 |
This theorem is referenced by: cleq1 14345 trcleq12lem 14355 lcmfun 15991 coprmproddvds 16009 isslw 18735 neival 21712 nrmsep3 21965 xkococnlem 22269 ovolval 24076 ovnval2b 42841 |
Copyright terms: Public domain | W3C validator |