Theorem seeq2 5607

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

Assertion

Ref	Expression
seeq2	⊢ (𝐴 = 𝐵 → (𝑅 Se 𝐴 ↔ 𝑅 Se 𝐵))

Proof of Theorem seeq2

Step	Hyp	Ref	Expression
1		eqimss2 3986	. . 3 ⊢ (𝐴 = 𝐵 → 𝐵 ⊆ 𝐴)
2		sess2 5602	. . 3 ⊢ (𝐵 ⊆ 𝐴 → (𝑅 Se 𝐴 → 𝑅 Se 𝐵))
3	1, 2	syl 17	. 2 ⊢ (𝐴 = 𝐵 → (𝑅 Se 𝐴 → 𝑅 Se 𝐵))
4		eqimss 3985	. . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵)
5		sess2 5602	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝑅 Se 𝐵 → 𝑅 Se 𝐴))
6	4, 5	syl 17	. 2 ⊢ (𝐴 = 𝐵 → (𝑅 Se 𝐵 → 𝑅 Se 𝐴))
7	3, 6	impbid 214	1 ⊢ (𝐴 = 𝐵 → (𝑅 Se 𝐴 ↔ 𝑅 Se 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1550   ⊆ wss 3895   Se wse 5587

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-ext 2724  ax-sep 5236

This theorem depends on definitions:  df-bi 209  df-an 399  df-3an 1097  df-tru 1553  df-ex 1790  df-sb 2081  df-clab 2731  df-cleq 2744  df-clel 2827  df-ral 3067  df-rab 3405  df-v 3446  df-in 3902  df-ss 3912  df-se 5590

This theorem is referenced by:  seeq12d  5608  oieq2  9447