MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cleq1lem Structured version   Visualization version   GIF version

Theorem cleq1lem 15178
Description: Equality implies bijection. (Contributed by RP, 9-May-2020.)
Assertion
Ref Expression
cleq1lem (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑)))

Proof of Theorem cleq1lem
StepHypRef Expression
1 sseq1 3938 . 2 (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶))
21anbi1d 643 1 (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ⊆ wss 3900
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2755  df-ss 3901
This theorem is used by:  cleq1  15179  trcleq12lem  15189  lcmfun  16864  coprmproddvds  16882  isslw  19873  neival  23475  nrmsep3  23728  xkococnlem  24033  ovolval  25849  tz9.1regs  35943  ovnval2b  47835
  Copyright terms: Public domain W3C validator