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

Theorem rdgsucmptf 8359
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 8355 . . 3 (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)))
2 rdgsucmptf.4 . . . 4 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
32fveq1i 6835 . . 3 (𝐹‘suc 𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵)
42fveq1i 6835 . . . 4 (𝐹𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)
54fveq2i 6837 . . 3 ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵))
61, 3, 53eqtr4g 2796 . 2 (𝐵 ∈ On → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)))
7 fvex 6847 . . 3 (𝐹𝐵) ∈ V
8 nfmpt1 5197 . . . . . . 7 𝑥(𝑥 ∈ V ↦ 𝐶)
9 rdgsucmptf.1 . . . . . . 7 𝑥𝐴
108, 9nfrdg 8345 . . . . . 6 𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
112, 10nfcxfr 2896 . . . . 5 𝑥𝐹
12 rdgsucmptf.2 . . . . 5 𝑥𝐵
1311, 12nffv 6844 . . . 4 𝑥(𝐹𝐵)
14 rdgsucmptf.3 . . . 4 𝑥𝐷
15 rdgsucmptf.5 . . . 4 (𝑥 = (𝐹𝐵) → 𝐶 = 𝐷)
16 eqid 2736 . . . 4 (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶)
1713, 14, 15, 16fvmptf 6962 . . 3 (((𝐹𝐵) ∈ V ∧ 𝐷𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)) = 𝐷)
187, 17mpan 690 . 2 (𝐷𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹𝐵)) = 𝐷)
196, 18sylan9eq 2791 1 ((𝐵 ∈ On ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wnfc 2883  Vcvv 3440  cmpt 5179  Oncon0 6317  suc csuc 6319  cfv 6492  reccrdg 8340
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341
This theorem is referenced by:  rdgsucmpt2  8361  rdgsucmpt  8362  ttrclselem1  9634  ttrclselem2  9635  rdgssun  37579  exrecfnlem  37580
  Copyright terms: Public domain W3C validator