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

Theorem frsucmpt2 8411
Description: The successor value resulting from finite recursive definition generation (special case where the generation function is expressed in maps-to notation), using double-substitution instead of a bound variable condition. (Contributed by Mario Carneiro, 11-Sep-2015.)
Hypotheses
Ref Expression
frsucmpt2.1 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
frsucmpt2.2 (𝑦 = 𝑥𝐸 = 𝐶)
frsucmpt2.3 (𝑦 = (𝐹𝐵) → 𝐸 = 𝐷)
Assertion
Ref Expression
frsucmpt2 ((𝐵 ∈ ω ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐵   𝑦,𝐶   𝑦,𝐷   𝑥,𝐸
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝐸(𝑦)   𝐹(𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem frsucmpt2
StepHypRef Expression
1 nfcv 2924 . 2 𝑦𝐴
2 nfcv 2924 . 2 𝑦𝐵
3 nfcv 2924 . 2 𝑦𝐷
4 frsucmpt2.1 . . 3 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
5 frsucmpt2.2 . . . . . 6 (𝑦 = 𝑥𝐸 = 𝐶)
65cbvmptv 5204 . . . . 5 (𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶)
7 rdgeq1 8382 . . . . 5 ((𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) → rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴))
86, 7ax-mp 5 . . . 4 rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
98reseq1i 5961 . . 3 (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
104, 9eqtr4i 2788 . 2 𝐹 = (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω)
11 frsucmpt2.3 . 2 (𝑦 = (𝐹𝐵) → 𝐸 = 𝐷)
121, 2, 3, 10, 11frsucmpt 8409 1 ((𝐵 ∈ ω ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1560  wcel 2142  Vcvv 3454  cmpt 5181  cres 5649  suc csuc 6348  cfv 6521  ωcom 7846  reccrdg 8380
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381
This theorem is referenced by:  unblem2  9237  unblem3  9238  inf0  9576  trcl  9683  hsmexlem8  10381  wunex2  10696  wuncval2  10705  peano5nni  12213  peano2nn  12222  om2uzsuci  13961  noseqp1  28384  noseqind  28385  om2noseqsuc  28390  dfnns2  28465  neibastop2lem  36720
  Copyright terms: Public domain W3C validator