Theorem cleq1lem 15021

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

Assertion

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

Proof of Theorem cleq1lem

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

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ⊆ wss 3906

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-cleq 2755  df-ss 3923

This theorem is referenced by:  cleq1  15022  trcleq12lem  15032  lcmfun  16704  coprmproddvds  16722  isslw  19679  neival  23240  nrmsep3  23493  xkococnlem  23797  ovolval  25613  tz9.1regs  35525  ovnval2b  47246