Theorem rdgeq2 6375

Description: Equality theorem for the recursive definition generator. (Contributed by NM, 9-Apr-1995.) (Revised by Mario Carneiro, 9-May-2015.)

Assertion

Ref	Expression
rdgeq2	⊢ (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵))

Proof of Theorem rdgeq2

Dummy variables 𝑥 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uneq1 3284	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))) = (𝐵 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))
2	1	mpteq2dv 4096	. . 3 ⊢ (𝐴 = 𝐵 → (𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))) = (𝑔 ∈ V ↦ (𝐵 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))))
3		recseq 6309	. . 3 ⊢ ((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))) = (𝑔 ∈ V ↦ (𝐵 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))) → recs((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))) = recs((𝑔 ∈ V ↦ (𝐵 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))))
4	2, 3	syl 14	. 2 ⊢ (𝐴 = 𝐵 → recs((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))) = recs((𝑔 ∈ V ↦ (𝐵 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥))))))
5		df-irdg 6373	. 2 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ (𝐴 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))))
6		df-irdg 6373	. 2 ⊢ rec(𝐹, 𝐵) = recs((𝑔 ∈ V ↦ (𝐵 ∪ ∪ 𝑥 ∈ dom 𝑔(𝐹‘(𝑔‘𝑥)))))
7	4, 5, 6	3eqtr4g 2235	1 ⊢ (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵))

Syntax hints:   → wi 4   = wceq 1353  Vcvv 2739   ∪ cun 3129  ∪ ciun 3888   ↦ cmpt 4066  dom cdm 4628  ‘cfv 5218  recscrecs 6307  reccrdg 6372

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-iota 5180  df-fv 5226  df-recs 6308  df-irdg 6373

This theorem is referenced by:  rdg0g  6391  oav  6457