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

Theorem rdgeq2 7395
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 variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 ifeq1 4040 . . . 4 (𝐴 = 𝐵 → if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))) = if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))))
21mpteq2dv 4673 . . 3 (𝐴 = 𝐵 → (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))) = (𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))))
3 recseq 7357 . . 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 𝑔)))))))
42, 3syl 17 . 2 (𝐴 = 𝐵 → recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))))) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔)))))))
5 df-rdg 7393 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))))
6 df-rdg 7393 . 2 rec(𝐹, 𝐵) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐵, if(Lim dom 𝑔, ran 𝑔, (𝐹‘(𝑔 dom 𝑔))))))
74, 5, 63eqtr4g 2669 1 (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1475  Vcvv 3173  c0 3874  ifcif 4036   cuni 4372  cmpt 4643  dom cdm 5038  ran crn 5039  Lim wlim 5641  cfv 5804  recscrecs 7354  reccrdg 7392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-xp 5044  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-iota 5768  df-fv 5812  df-wrecs 7294  df-recs 7355  df-rdg 7393
This theorem is referenced by:  rdgeq12  7396  rdg0g  7410  oav  7478  itunifval  9121  hsmex  9137  ltweuz  12622  seqeq1  12666  dfrdg2  30945  trpredeq3  30966  finxpeq2  32400  finxpreclem6  32409  finxpsuclem  32410
  Copyright terms: Public domain W3C validator