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

Theorem rdgsucmpt2 8066
Description: This version of rdgsucmpt 8067 avoids the not-free hypothesis of rdgsucmptf 8064 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 2977 . 2 𝑦𝐴
2 nfcv 2977 . 2 𝑦𝐵
3 nfcv 2977 . 2 𝑦𝐷
4 rdgsucmpt2.1 . . 3 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
5 rdgsucmpt2.2 . . . . 5 (𝑦 = 𝑥𝐸 = 𝐶)
65cbvmptv 5169 . . . 4 (𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶)
7 rdgeq1 8047 . . . 4 ((𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) → rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴))
86, 7ax-mp 5 . . 3 rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
94, 8eqtr4i 2847 . 2 𝐹 = rec((𝑦 ∈ V ↦ 𝐸), 𝐴)
10 rdgsucmpt2.3 . 2 (𝑦 = (𝐹𝐵) → 𝐸 = 𝐷)
111, 2, 3, 9, 10rdgsucmptf 8064 1 ((𝐵 ∈ On ∧ 𝐷𝑉) → (𝐹‘suc 𝐵) = 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  Vcvv 3494  cmpt 5146  Oncon0 6191  suc csuc 6193  cfv 6355  reccrdg 8045
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-wrecs 7947  df-recs 8008  df-rdg 8046
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator