Theorem wrecseq1

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

	Ref	Expression
Assertion	wrecseq1	$$⊢R=S\to \mathrm{wrecs}\left(R,A,F\right)=\mathrm{wrecs}\left(S,A,F\right)$$

Proof

Step	Hyp	Ref	Expression
1		eqid	$$⊢A=A$$
2		eqid	$$⊢F=F$$
3		wrecseq123	$$⊢\left(R=S\wedge A=A\wedge F=F\right)\to \mathrm{wrecs}\left(R,A,F\right)=\mathrm{wrecs}\left(S,A,F\right)$$
4	1 2 3	mp3an23	$$⊢R=S\to \mathrm{wrecs}\left(R,A,F\right)=\mathrm{wrecs}\left(S,A,F\right)$$