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

Theorem frsucmpt2 8359
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 2894 . 2 𝑦𝐴
2 nfcv 2894 . 2 𝑦𝐵
3 nfcv 2894 . 2 𝑦𝐷
4 frsucmpt2.1 . . 3 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
5 frsucmpt2.2 . . . . . 6 (𝑦 = 𝑥𝐸 = 𝐶)
65cbvmptv 5193 . . . . 5 (𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶)
7 rdgeq1 8330 . . . . 5 ((𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) → rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴))
86, 7ax-mp 5 . . . 4 rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
98reseq1i 5923 . . 3 (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
104, 9eqtr4i 2757 . 2 𝐹 = (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω)
11 frsucmpt2.3 . 2 (𝑦 = (𝐹𝐵) → 𝐸 = 𝐷)
121, 2, 3, 10, 11frsucmpt 8357 1 ((𝐵 ∈ ω ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  Vcvv 3436  cmpt 5170  cres 5616  suc csuc 6308  cfv 6481  ωcom 7796  reccrdg 8328
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-om 7797  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329
This theorem is referenced by:  unblem2  9177  unblem3  9178  inf0  9511  trcl  9618  hsmexlem8  10315  wunex2  10629  wuncval2  10638  peano5nni  12128  peano2nn  12137  om2uzsuci  13855  noseqp1  28221  noseqind  28222  om2noseqsuc  28227  dfnns2  28297  neibastop2lem  36402
  Copyright terms: Public domain W3C validator