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

Theorem rdgsucmpt2 8488
Description: This version of rdgsucmpt 8489 avoids the not-free hypothesis of rdgsucmptf 8486 by using two substitutions instead of one. (Contributed by Mario Carneiro, 11-Sep-2015.)
Hypotheses
Ref Expression
rdgsucmpt2.1 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
rdgsucmpt2.2 (𝑦 = 𝑥𝐸 = 𝐶)
rdgsucmpt2.3 (𝑦 = (𝐹𝐵) → 𝐸 = 𝐷)
Assertion
Ref Expression
rdgsucmpt2 ((𝐵 ∈ On ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐵   𝑦,𝐶   𝑦,𝐷   𝑥,𝐸
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝐸(𝑦)   𝐹(𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem rdgsucmpt2
StepHypRef Expression
1 nfcv 2908 . 2 𝑦𝐴
2 nfcv 2908 . 2 𝑦𝐵
3 nfcv 2908 . 2 𝑦𝐷
4 rdgsucmpt2.1 . . 3 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
5 rdgsucmpt2.2 . . . . 5 (𝑦 = 𝑥𝐸 = 𝐶)
65cbvmptv 5279 . . . 4 (𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶)
7 rdgeq1 8469 . . . 4 ((𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) → rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴))
86, 7ax-mp 5 . . 3 rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
94, 8eqtr4i 2771 . 2 𝐹 = rec((𝑦 ∈ V ↦ 𝐸), 𝐴)
10 rdgsucmpt2.3 . 2 (𝑦 = (𝐹𝐵) → 𝐸 = 𝐷)
111, 2, 3, 9, 10rdgsucmptf 8486 1 ((𝐵 ∈ On ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  Vcvv 3488  cmpt 5249  Oncon0 6397  suc csuc 6399  cfv 6575  reccrdg 8467
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7772
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6334  df-ord 6400  df-on 6401  df-lim 6402  df-suc 6403  df-iota 6527  df-fun 6577  df-fn 6578  df-f 6579  df-f1 6580  df-fo 6581  df-f1o 6582  df-fv 6583  df-ov 7453  df-2nd 8033  df-frecs 8324  df-wrecs 8355  df-recs 8429  df-rdg 8468
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator