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

Theorem rdgeq1 8347
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 6833 . . . . . 6 (𝐹 = 𝐺 → (𝐹‘(𝑔 dom 𝑔)) = (𝐺‘(𝑔 dom 𝑔)))
21ifeq2d 4482 . . . . 5 (𝐹 = 𝐺 → if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))) = if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))
32ifeq2d 4482 . . . 4 (𝐹 = 𝐺 → if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))) = if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔)))))
43mpteq2dv 5173 . . 3 (𝐹 = 𝐺 → (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))))
5 recseq 8310 . . 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 17 . 2 (𝐹 = 𝐺 → recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))))) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔)))))))
7 df-rdg 8346 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))))
8 df-rdg 8346 . 2 rec(𝐺, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐺‘(𝑔 dom 𝑔))))))
96, 7, 83eqtr4g 2800 1 (𝐹 = 𝐺 → rec(𝐹, 𝐴) = rec(𝐺, 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  Vcvv 3432  c0 4268  ifcif 4461   cuni 4845  cmpt 5160  dom cdm 5625  ran crn 5626  Lim wlim 6318  cfv 6492  recscrecs 8307  reccrdg 8345
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-xp 5631  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-iota 6448  df-fv 6500  df-ov 7366  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346
This theorem is referenced by:  rdgeq12  8349  rdgsucmpt2  8366  frsucmpt2  8376  seqomlem0  8385  omv  8444  oev  8446  dffi3  9341  hsmex  10352  axdc  10441  seqeq2  13965  seqval  13972  precsexlemcbv  28223  seqsval  28305  seqsfn  28326  seqsp1  28328  constrcbvlem  33946  neibastop2  36596  rdgssun  37747  exrecfnlem  37748  dffinxpf  37754  finxpeq1  37755
  Copyright terms: Public domain W3C validator