Theorem seeq12d 5604

Description: Equality deduction for the set-like predicate. (Contributed by Matthew House, 10-Sep-2025.)

Hypotheses

Ref	Expression
seeq12d.1	⊢ (𝜑 → 𝑅 = 𝑆)
seeq12d.2	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
seeq12d	⊢ (𝜑 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐵))

Proof of Theorem seeq12d

Step	Hyp	Ref	Expression
1		seeq12d.1	. 2 ⊢ (𝜑 → 𝑅 = 𝑆)
2		seeq12d.2	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
3		seeq1 5602	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐴))
4		seeq2 5603	. . 3 ⊢ (𝐴 = 𝐵 → (𝑆 Se 𝐴 ↔ 𝑆 Se 𝐵))
5	3, 4	sylan9bb 509	. 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐵))
6	1, 2, 5	syl2anc 585	1 ⊢ (𝜑 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   Se wse 5583

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-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1089  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3402  df-v 3444  df-in 3910  df-ss 3920  df-br 5101  df-se 5586

This theorem is referenced by: (None)