Theorem wrecseq1

Description: Equality theorem for the well-ordered recursive function generator. (Contributed by Scott Fenton, 7-Jun-2018)

	Ref	Expression
Assertion	wrecseq1	⊢ ( 𝑅 = 𝑆 → wrecs ( 𝑅 , 𝐴 , 𝐹 ) = wrecs ( 𝑆 , 𝐴 , 𝐹 ) )

Proof

Step	Hyp	Ref	Expression
1		eqid	⊢ 𝐴 = 𝐴
2		eqid	⊢ 𝐹 = 𝐹
3		wrecseq123	⊢ ( ( 𝑅 = 𝑆 ∧ 𝐴 = 𝐴 ∧ 𝐹 = 𝐹 ) → wrecs ( 𝑅 , 𝐴 , 𝐹 ) = wrecs ( 𝑆 , 𝐴 , 𝐹 ) )
4	1 2 3	mp3an23	⊢ ( 𝑅 = 𝑆 → wrecs ( 𝑅 , 𝐴 , 𝐹 ) = wrecs ( 𝑆 , 𝐴 , 𝐹 ) )