Theorem seeq1 5592

Description: Equality theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.)

Assertion

Ref	Expression
seeq1	⊢ (𝑅 = 𝑆 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐴))

Proof of Theorem seeq1

Step	Hyp	Ref	Expression
1		eqimss2 3991	. . 3 ⊢ (𝑅 = 𝑆 → 𝑆 ⊆ 𝑅)
2		sess1 5587	. . 3 ⊢ (𝑆 ⊆ 𝑅 → (𝑅 Se 𝐴 → 𝑆 Se 𝐴))
3	1, 2	syl 17	. 2 ⊢ (𝑅 = 𝑆 → (𝑅 Se 𝐴 → 𝑆 Se 𝐴))
4		eqimss 3990	. . 3 ⊢ (𝑅 = 𝑆 → 𝑅 ⊆ 𝑆)
5		sess1 5587	. . 3 ⊢ (𝑅 ⊆ 𝑆 → (𝑆 Se 𝐴 → 𝑅 Se 𝐴))
6	4, 5	syl 17	. 2 ⊢ (𝑅 = 𝑆 → (𝑆 Se 𝐴 → 𝑅 Se 𝐴))
7	3, 6	impbid 212	1 ⊢ (𝑅 = 𝑆 → (𝑅 Se 𝐴 ↔ 𝑆 Se 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1541   ⊆ wss 3899   Se wse 5573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1088  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rab 3398  df-v 3440  df-in 3906  df-ss 3916  df-br 5097  df-se 5576

This theorem is referenced by:  seeq12d  5594  oieq1  9415