Theorem cleq1lem 14917

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

Assertion

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

Proof of Theorem cleq1lem

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

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ⊆ wss 3903

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 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-cleq 2729  df-ss 3920

This theorem is referenced by:  cleq1  14918  trcleq12lem  14928  lcmfun  16584  coprmproddvds  16602  isslw  19549  neival  23058  nrmsep3  23311  xkococnlem  23615  ovolval  25442  tz9.1regs  35309  ovnval2b  46904