Theorem cleq1lem 15164

Description: Equality implies bijection. (Contributed by RP, 9-May-2020.)

Assertion

Ref	Expression
cleq1lem	⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑)))

Proof of Theorem cleq1lem

Step	Hyp	Ref	Expression
1		sseq1 3938	. 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶))
2	1	anbi1d 643	1 ⊢ (𝐴 = 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝜑) ↔ (𝐵 ⊆ 𝐶 ∧ 𝜑)))

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  15165  trcleq12lem  15175  lcmfun  16849  coprmproddvds  16867  isslw  19852  neival  23450  nrmsep3  23703  xkococnlem  24008  ovolval  25824  tz9.1regs  35902  ovnval2b  47767