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

Theorem rdgsucmptf 8416
Description: The value of the recursive definition generator at a successor (special case where the characteristic function uses the map operation). (Contributed by NM, 22-Oct-2003.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
rdgsucmptf.1 𝑥𝐴
rdgsucmptf.2 𝑥𝐵
rdgsucmptf.3 𝑥𝐷
rdgsucmptf.4 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
rdgsucmptf.5 (𝑥 = (𝐹𝐵) → 𝐶 = 𝐷)
Assertion
Ref Expression
rdgsucmptf ((𝐵 ∈ On ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)

Proof of Theorem rdgsucmptf
StepHypRef Expression
1 rdgsuc 8412 . . 3 (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)))
2 rdgsucmptf.4 . . . 4 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
32fveq1i 6884 . . 3 (𝐹‘suc 𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵)
42fveq1i 6884 . . . 4 (𝐹𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)
54fveq2i 6886 . . 3 ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵))
61, 3, 53eqtr4g 2823 . 2 (𝐵 ∈ On → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)))
7 fvex 6896 . . 3 (𝐹𝐵) ∈ V
8 nfmpt1 5211 . . . . . . 7 𝑥(𝑥 ∈ V ↦ 𝐶)
9 rdgsucmptf.1 . . . . . . 7 𝑥𝐴
108, 9nfrdg 8402 . . . . . 6 𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
112, 10nfcxfr 2923 . . . . 5 𝑥𝐹
12 rdgsucmptf.2 . . . . 5 𝑥𝐵
1311, 12nffv 6893 . . . 4 𝑥(𝐹𝐵)
14 rdgsucmptf.3 . . . 4 𝑥𝐷
15 rdgsucmptf.5 . . . 4 (𝑥 = (𝐹𝐵) → 𝐶 = 𝐷)
16 eqid 2763 . . . 4 (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶)
1713, 14, 15, 16fvmptf 7013 . . 3 (((𝐹𝐵) ∈ V ∧ 𝐷𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)) = 𝐷)
187, 17mpan 702 . 2 (𝐷𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)) = 𝐷)
196, 18sylan9eq 2818 1 ((𝐵 ∈ On ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wnfc 2910  Vcvv 3455  cmpt 5193  Oncon0 6362  suc csuc 6364  cfv 6538  reccrdg 8397
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398
This theorem is referenced by:  rdgsucmpt2  8418  rdgsucmpt  8419  ttrclselem1  9695  ttrclselem2  9696  rdgssun  38002  exrecfnlem  38003
  Copyright terms: Public domain W3C validator