Theorem seeq12d 5590

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 5588	. . 3 ⊢ (𝑅 = 𝑆 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐴))
4		seeq2 5589	. . 3 ⊢ (𝐴 = 𝐵 → (𝑆 Se 𝐴 ↔ 𝑆 Se 𝐵))
5	3, 4	sylan9bb 514	. 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐵))
6	1, 2, 5	syl2anc 590	1 ⊢ (𝜑 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐵))

Syntax hints:   → wi 4   ↔ wb 207   = wceq 1547   Se wse 5569

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218

This theorem depends on definitions:  df-bi 208  df-an 397  df-3an 1094  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rab 3392  df-v 3433  df-in 3890  df-ss 3900  df-br 5073  df-se 5572

This theorem is referenced by: (None)