Theorem scotteq 9931

Description: Closed form of scotteqd 9930. (Contributed by Rohan Ridenour, 9-Aug-2023.)

Assertion

Ref	Expression
scotteq	⊢ (𝐴 = 𝐵 → Scott 𝐴 = Scott 𝐵)

Proof of Theorem scotteq

Step	Hyp	Ref	Expression
1		id 23	. 2 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵)
2	1	scotteqd 9930	1 ⊢ (𝐴 = 𝐵 → Scott 𝐴 = Scott 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1569  Scott cscott 9928

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-scott 9929

This theorem is used by:  scott0b  9937  scotteqi  35740