MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rdgeq1 Structured version   Visualization version   GIF version

Theorem rdgeq1 8386
Description: Equality theorem for the recursive definition generator. (Contributed by NM, 9-Apr-1995.) (Revised by Mario Carneiro, 9-May-2015.)
Assertion
Ref Expression
rdgeq1 (𝐹 = 𝐺 → rec(𝐹, 𝐴) = rec(𝐺, 𝐴))

Proof of Theorem rdgeq1
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 fveq1 6870 . . . . . 6 (𝐹 = 𝐺 → (𝐹‘(𝑔 dom 𝑔)) = (𝐺‘(𝑔 dom 𝑔)))
21ifeq2d 4504 . . . . 5 (𝐹 = 𝐺 → if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))) = if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))
32ifeq2d 4504 . . . 4 (𝐹 = 𝐺 → if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))) = if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔)))))
43mpteq2dv 5199 . . 3 (𝐹 = 𝐺 → (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))))
5 recseq 8348 . . 3 ((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))) → recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))))) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔)))))))
64, 5syl 18 . 2 (𝐹 = 𝐺 → recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))))) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔)))))))
7 df-rdg 8385 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))))
8 df-rdg 8385 . 2 rec(𝐺, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))))
96, 7, 83eqtr4g 2825 1 (𝐹 = 𝐺 → rec(𝐹, 𝐴) = rec(𝐺, 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1563  Vcvv 3457  c0 4288  ifcif 4483   cuni 4868  cmpt 5186  dom cdm 5652  ran crn 5653  Lim wlim 6351  cfv 6525  recscrecs 8345  reccrdg 8384
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-xp 5658  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-iota 6481  df-fv 6533  df-ov 7403  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385
This theorem is referenced by:  rdgeq12  8388  rdgsucmpt2  8405  frsucmpt2  8415  seqomlem0  8424  omv  8485  oev  8487  dffi3  9379  hsmex  10404  axdc  10493  seqeq2  14032  seqval  14039  precsexlemcbv  28357  seqsval  28439  seqsfn  28460  seqsp1  28462  constrcbvlem  34062  neibastop2  36734  rdgssun  37884  exrecfnlem  37885  dffinxpf  37891  finxpeq1  37892
  Copyright terms: Public domain W3C validator