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

Theorem noseqrdgsuc 28751
Description: Successor value of a recursive definition generator on surreal sequences. (Contributed by Scott Fenton, 19-Apr-2025.)
Hypotheses
Ref Expression
om2noseq.1 (𝜑 → 𝐶 ∈ No)
om2noseq.2 (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
om2noseq.3 (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
noseqrdg.1 (𝜑 → 𝐴 ∈ 𝑉)
noseqrdg.2 (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
noseqrdg.3 (𝜑 → 𝑆 = ran 𝑅)
Assertion
Ref Expression
noseqrdgsuc ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (𝐵𝐹(𝑆‘𝐵)))
Distinct variable groups:   𝑥,𝐶   𝑥,𝐹,𝑦   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑦)   𝐶(𝑦)   𝑅(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝐺(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑍(𝑥, 𝑦)

Proof of Theorem noseqrdgsuc
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 om2noseq.1 . . . . . . 7 (𝜑 → 𝐶 ∈ No)
2 om2noseq.2 . . . . . . 7 (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
3 om2noseq.3 . . . . . . 7 (𝜑 → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
4 noseqrdg.1 . . . . . . 7 (𝜑 → 𝐴 ∈ 𝑉)
5 noseqrdg.2 . . . . . . 7 (𝜑 → 𝑅 = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω))
6 noseqrdg.3 . . . . . . 7 (𝜑 → 𝑆 = ran 𝑅)
71, 2, 3, 4, 5, 6noseqrdgfn 28749 . . . . . 6 (𝜑 → 𝑆 Fn 𝑍)
87adantr 486 . . . . 5 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑆 Fn 𝑍)
98fnfund 6670 . . . 4 ((𝜑 ∧ 𝐵 ∈ 𝑍) → Fun 𝑆)
103adantr 486 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑍 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) “ ω))
111adantr 486 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐶 ∈ No)
12 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐵 ∈ 𝑍)
1310, 11, 12noseqp1 28734 . . . . . 6 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐵 +s 1s ) ∈ 𝑍)
141, 2, 3, 4, 5noseqrdglem 28748 . . . . . 6 ((𝜑 ∧ (𝐵 +s 1s ) ∈ 𝑍) → ⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ ran 𝑅)
1513, 14syldan 603 . . . . 5 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ ran 𝑅)
166adantr 486 . . . . 5 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝑆 = ran 𝑅)
1715, 16eleqtrrd 2867 . . . 4 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ 𝑆)
18 funopfv 6965 . . . 4 (Fun 𝑆 → (⟨(𝐵 +s 1s ), (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))⟩ ∈ 𝑆 → (𝑆‘(𝐵 +s 1s )) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s ))))))
199, 17, 18sylc 66 . . 3 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s )))))
201, 2, 3om2noseqf1o 28744 . . . . . . . 8 (𝜑 → 𝐺:ω⟶1-1onto𝑍)
2120adantr 486 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐺:ω⟶1-1onto𝑍)
22 f1ocnvdm 7324 . . . . . . . . 9 ((𝐺:ω⟶1-1onto𝑍 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
2320, 22sylan 592 . . . . . . . 8 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘𝐵) ∈ ω)
24 peano2 7935 . . . . . . . 8 ((◡𝐺‘𝐵) ∈ ω → suc (◡𝐺‘𝐵) ∈ ω)
2523, 24syl 18 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → suc (◡𝐺‘𝐵) ∈ ω)
2621, 25jca 521 . . . . . 6 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺:ω⟶1-1onto𝑍 ∧ suc (◡𝐺‘𝐵) ∈ ω))
272adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝐵 ∈ 𝑍) → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω))
2811, 27, 23om2noseqsuc 28740 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵)) +s 1s ))
29 f1ocnvfv2 7316 . . . . . . . . 9 ((𝐺:ω⟶1-1onto𝑍 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
3020, 29sylan 592 . . . . . . . 8 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘(◡𝐺‘𝐵)) = 𝐵)
3130oveq1d 7466 . . . . . . 7 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ((𝐺‘(◡𝐺‘𝐵)) +s 1s ) = (𝐵 +s 1s ))
3228, 31eqtrd 2798 . . . . . 6 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 +s 1s ))
33 f1ocnvfv 7317 . . . . . 6 ((𝐺:ω⟶1-1onto𝑍 ∧ suc (◡𝐺‘𝐵) ∈ ω) → ((𝐺‘suc (◡𝐺‘𝐵)) = (𝐵 +s 1s ) → (◡𝐺‘(𝐵 +s 1s )) = suc (◡𝐺‘𝐵)))
3426, 32, 33sylc 66 . . . . 5 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (◡𝐺‘(𝐵 +s 1s )) = suc (◡𝐺‘𝐵))
3534fveq2d 6920 . . . 4 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑅‘(◡𝐺‘(𝐵 +s 1s ))) = (𝑅‘suc (◡𝐺‘𝐵)))
3635fveq2d 6920 . . 3 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (2nd ‘(𝑅‘(◡𝐺‘(𝐵 +s 1s )))) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
3719, 36eqtrd 2798 . 2 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))))
38 frsuc 8483 . . . . . . . . 9 ((◡𝐺‘𝐵) ∈ ω → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
3938adantl 487 . . . . . . . 8 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
405fveq1d 6918 . . . . . . . . 9 (𝜑 → (𝑅‘suc (◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)))
4140adantr 486 . . . . . . . 8 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘suc (◡𝐺‘𝐵)))
425fveq1d 6918 . . . . . . . . . 10 (𝜑 → (𝑅‘(◡𝐺‘𝐵)) = ((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵)))
4342fveq2d 6920 . . . . . . . . 9 (𝜑 → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
4443adantr 486 . . . . . . . 8 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘((rec((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩) ↾ ω)‘(◡𝐺‘𝐵))))
4539, 41, 443eqtr4d 2808 . . . . . . 7 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))))
461, 2, 3, 4, 5om2noseqrdg 28747 . . . . . . . . 9 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘(◡𝐺‘𝐵)) = ⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
4746fveq2d 6920 . . . . . . . 8 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩))
48 df-ov 7454 . . . . . . . 8 ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘⟨(𝐺‘(◡𝐺‘𝐵)), (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩)
4947, 48eqtr4di 2816 . . . . . . 7 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → ((𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)‘(𝑅‘(◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
5045, 49eqtrd 2798 . . . . . 6 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
51 fvex 6929 . . . . . . 7 (𝐺‘(◡𝐺‘𝐵)) ∈ V
52 fvex 6929 . . . . . . 7 (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ V
53 oveq1 7458 . . . . . . . . 9 (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧 +s 1s ) = ((𝐺‘(◡𝐺‘𝐵)) +s 1s ))
54 oveq1 7458 . . . . . . . . 9 (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → (𝑧𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤))
5553, 54opeq12d 4853 . . . . . . . 8 (𝑧 = (𝐺‘(◡𝐺‘𝐵)) → ⟨(𝑧 +s 1s ), (𝑧𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩)
56 oveq2 7459 . . . . . . . . 9 (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
5756opeq2d 4852 . . . . . . . 8 (𝑤 = (2nd ‘(𝑅‘(◡𝐺‘𝐵))) → ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹𝑤)⟩ = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
58 oveq1 7458 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝑥 +s 1s ) = (𝑧 +s 1s ))
59 oveq1 7458 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝑥𝐹𝑦) = (𝑧𝐹𝑦))
6058, 59opeq12d 4853 . . . . . . . . 9 (𝑥 = 𝑧 → ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩ = ⟨(𝑧 +s 1s ), (𝑧𝐹𝑦)⟩)
61 oveq2 7459 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝑧𝐹𝑦) = (𝑧𝐹𝑤))
6261opeq2d 4852 . . . . . . . . 9 (𝑦 = 𝑤 → ⟨(𝑧 +s 1s ), (𝑧𝐹𝑦)⟩ = ⟨(𝑧 +s 1s ), (𝑧𝐹𝑤)⟩)
6360, 62cbvmpov 7546 . . . . . . . 8 (𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩) = (𝑧 ∈ V, 𝑤 ∈ V ↦ ⟨(𝑧 +s 1s ), (𝑧𝐹𝑤)⟩)
64 opex 5439 . . . . . . . 8 ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩ ∈ V
6555, 57, 63, 64ovmpo 7612 . . . . . . 7 (((𝐺‘(◡𝐺‘𝐵)) ∈ V ∧ (2nd ‘(𝑅‘(◡𝐺‘𝐵))) ∈ V) → ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
6651, 52, 65mp2an 705 . . . . . 6 ((𝐺‘(◡𝐺‘𝐵))(𝑥 ∈ V, 𝑦 ∈ V ↦ ⟨(𝑥 +s 1s ), (𝑥𝐹𝑦)⟩)(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩
6750, 66eqtrdi 2814 . . . . 5 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (𝑅‘suc (◡𝐺‘𝐵)) = ⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩)
6867fveq2d 6920 . . . 4 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩))
69 ovex 7484 . . . . 5 ((𝐺‘(◡𝐺‘𝐵)) +s 1s ) ∈ V
70 ovex 7484 . . . . 5 ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) ∈ V
7169, 70op2nd 8044 . . . 4 (2nd ‘⟨((𝐺‘(◡𝐺‘𝐵)) +s 1s ), ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))⟩) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵))))
7268, 71eqtrdi 2814 . . 3 ((𝜑 ∧ (◡𝐺‘𝐵) ∈ ω) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
7323, 72syldan 603 . 2 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (2nd ‘(𝑅‘suc (◡𝐺‘𝐵))) = ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
741, 2, 3, 4, 5noseqrdglem 28748 . . . . . 6 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ ran 𝑅)
7574, 16eleqtrrd 2867 . . . . 5 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑆)
76 funopfv 6965 . . . . 5 (Fun 𝑆 → (⟨𝐵, (2nd ‘(𝑅‘(◡𝐺‘𝐵)))⟩ ∈ 𝑆 → (𝑆‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵)))))
779, 75, 76sylc 66 . . . 4 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘𝐵) = (2nd ‘(𝑅‘(◡𝐺‘𝐵))))
7877eqcomd 2769 . . 3 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (2nd ‘(𝑅‘(◡𝐺‘𝐵))) = (𝑆‘𝐵))
7930, 78oveq12d 7469 . 2 ((𝜑 ∧ 𝐵 ∈ 𝑍) → ((𝐺‘(◡𝐺‘𝐵))𝐹(2nd ‘(𝑅‘(◡𝐺‘𝐵)))) = (𝐵𝐹(𝑆‘𝐵)))
8037, 73, 793eqtrd 2802 1 ((𝜑 ∧ 𝐵 ∈ 𝑍) → (𝑆‘(𝐵 +s 1s )) = (𝐵𝐹(𝑆‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   ↦ cmpt 5192  ◡ccnv 5657  ran crn 5659   ↾ cres 5660   “ cima 5661  suc csuc 6390  Fun wfun 6560   Fn wfn 6561  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  ωcom 7911  2nd c2nd 8034  reccrdg 8455  Nocsur 28054   1s c1s 28249   +s cadds 28402
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-nadd 8713  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-1s 28251  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec2 28392  df-adds 28403
This theorem is used by:  seqsp1  28754
  Copyright terms: Public domain W3C validator