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

Theorem seqomlem4 7548
Description: Lemma for seq𝜔. (Contributed by Stefan O'Rear, 1-Nov-2014.) (Revised by Mario Carneiro, 23-Jun-2015.)
Hypothesis
Ref Expression
seqomlem.a 𝑄 = rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)
Assertion
Ref Expression
seqomlem4 (𝐴 ∈ ω → ((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)))
Distinct variable groups:   𝑄,𝑖,𝑣   𝐴,𝑖,𝑣   𝑖,𝐹,𝑣
Allowed substitution hints:   𝐼(𝑣,𝑖)

Proof of Theorem seqomlem4
StepHypRef Expression
1 peano2 7086 . . . . . . 7 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 fvres 6207 . . . . . . 7 (suc 𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) = (𝑄‘suc 𝐴))
31, 2syl 17 . . . . . 6 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) = (𝑄‘suc 𝐴))
4 frsuc 7532 . . . . . . . 8 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝐴) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴)))
5 fvres 6207 . . . . . . . . . 10 (suc 𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘suc 𝐴))
61, 5syl 17 . . . . . . . . 9 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘suc 𝐴))
7 seqomlem.a . . . . . . . . . 10 𝑄 = rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)
87fveq1i 6192 . . . . . . . . 9 (𝑄‘suc 𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘suc 𝐴)
96, 8syl6eqr 2674 . . . . . . . 8 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝐴) = (𝑄‘suc 𝐴))
10 fvres 6207 . . . . . . . . . 10 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘𝐴))
117fveq1i 6192 . . . . . . . . . 10 (𝑄𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘𝐴)
1210, 11syl6eqr 2674 . . . . . . . . 9 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴) = (𝑄𝐴))
1312fveq2d 6195 . . . . . . . 8 (𝐴 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴)) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝐴)))
144, 9, 133eqtr3d 2664 . . . . . . 7 (𝐴 ∈ ω → (𝑄‘suc 𝐴) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝐴)))
157seqomlem1 7545 . . . . . . . 8 (𝐴 ∈ ω → (𝑄𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
1615fveq2d 6195 . . . . . . 7 (𝐴 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝐴)) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝐴, (2nd ‘(𝑄𝐴))⟩))
17 df-ov 6653 . . . . . . . 8 (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
18 fvex 6201 . . . . . . . . . 10 (2nd ‘(𝑄𝐴)) ∈ V
19 suceq 5790 . . . . . . . . . . . 12 (𝑖 = 𝐴 → suc 𝑖 = suc 𝐴)
20 oveq1 6657 . . . . . . . . . . . 12 (𝑖 = 𝐴 → (𝑖𝐹𝑣) = (𝐴𝐹𝑣))
2119, 20opeq12d 4410 . . . . . . . . . . 11 (𝑖 = 𝐴 → ⟨suc 𝑖, (𝑖𝐹𝑣)⟩ = ⟨suc 𝐴, (𝐴𝐹𝑣)⟩)
22 oveq2 6658 . . . . . . . . . . . 12 (𝑣 = (2nd ‘(𝑄𝐴)) → (𝐴𝐹𝑣) = (𝐴𝐹(2nd ‘(𝑄𝐴))))
2322opeq2d 4409 . . . . . . . . . . 11 (𝑣 = (2nd ‘(𝑄𝐴)) → ⟨suc 𝐴, (𝐴𝐹𝑣)⟩ = ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩)
24 eqid 2622 . . . . . . . . . . 11 (𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩) = (𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)
25 opex 4932 . . . . . . . . . . 11 ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩ ∈ V
2621, 23, 24, 25ovmpt2 6796 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ (2nd ‘(𝑄𝐴)) ∈ V) → (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩)
2718, 26mpan2 707 . . . . . . . . 9 (𝐴 ∈ ω → (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩)
28 fvres 6207 . . . . . . . . . . . . . . . . 17 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘𝐴) = (𝑄𝐴))
2928, 15eqtrd 2656 . . . . . . . . . . . . . . . 16 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
30 frfnom 7530 . . . . . . . . . . . . . . . . . 18 (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω) Fn ω
317reseq1i 5392 . . . . . . . . . . . . . . . . . . 19 (𝑄 ↾ ω) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)
3231fneq1i 5985 . . . . . . . . . . . . . . . . . 18 ((𝑄 ↾ ω) Fn ω ↔ (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω) Fn ω)
3330, 32mpbir 221 . . . . . . . . . . . . . . . . 17 (𝑄 ↾ ω) Fn ω
34 fnfvelrn 6356 . . . . . . . . . . . . . . . . 17 (((𝑄 ↾ ω) Fn ω ∧ 𝐴 ∈ ω) → ((𝑄 ↾ ω)‘𝐴) ∈ ran (𝑄 ↾ ω))
3533, 34mpan 706 . . . . . . . . . . . . . . . 16 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘𝐴) ∈ ran (𝑄 ↾ ω))
3629, 35eqeltrrd 2702 . . . . . . . . . . . . . . 15 (𝐴 ∈ ω → ⟨𝐴, (2nd ‘(𝑄𝐴))⟩ ∈ ran (𝑄 ↾ ω))
37 df-ima 5127 . . . . . . . . . . . . . . 15 (𝑄 “ ω) = ran (𝑄 ↾ ω)
3836, 37syl6eleqr 2712 . . . . . . . . . . . . . 14 (𝐴 ∈ ω → ⟨𝐴, (2nd ‘(𝑄𝐴))⟩ ∈ (𝑄 “ ω))
39 df-br 4654 . . . . . . . . . . . . . 14 (𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴)) ↔ ⟨𝐴, (2nd ‘(𝑄𝐴))⟩ ∈ (𝑄 “ ω))
4038, 39sylibr 224 . . . . . . . . . . . . 13 (𝐴 ∈ ω → 𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴)))
417seqomlem2 7546 . . . . . . . . . . . . . 14 (𝑄 “ ω) Fn ω
42 fnbrfvb 6236 . . . . . . . . . . . . . 14 (((𝑄 “ ω) Fn ω ∧ 𝐴 ∈ ω) → (((𝑄 “ ω)‘𝐴) = (2nd ‘(𝑄𝐴)) ↔ 𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴))))
4341, 42mpan 706 . . . . . . . . . . . . 13 (𝐴 ∈ ω → (((𝑄 “ ω)‘𝐴) = (2nd ‘(𝑄𝐴)) ↔ 𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴))))
4440, 43mpbird 247 . . . . . . . . . . . 12 (𝐴 ∈ ω → ((𝑄 “ ω)‘𝐴) = (2nd ‘(𝑄𝐴)))
4544eqcomd 2628 . . . . . . . . . . 11 (𝐴 ∈ ω → (2nd ‘(𝑄𝐴)) = ((𝑄 “ ω)‘𝐴))
4645oveq2d 6666 . . . . . . . . . 10 (𝐴 ∈ ω → (𝐴𝐹(2nd ‘(𝑄𝐴))) = (𝐴𝐹((𝑄 “ ω)‘𝐴)))
4746opeq2d 4409 . . . . . . . . 9 (𝐴 ∈ ω → ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩ = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
4827, 47eqtrd 2656 . . . . . . . 8 (𝐴 ∈ ω → (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
4917, 48syl5eqr 2670 . . . . . . 7 (𝐴 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝐴, (2nd ‘(𝑄𝐴))⟩) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
5014, 16, 493eqtrd 2660 . . . . . 6 (𝐴 ∈ ω → (𝑄‘suc 𝐴) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
513, 50eqtrd 2656 . . . . 5 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
52 fnfvelrn 6356 . . . . . 6 (((𝑄 ↾ ω) Fn ω ∧ suc 𝐴 ∈ ω) → ((𝑄 ↾ ω)‘suc 𝐴) ∈ ran (𝑄 ↾ ω))
5333, 1, 52sylancr 695 . . . . 5 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) ∈ ran (𝑄 ↾ ω))
5451, 53eqeltrrd 2702 . . . 4 (𝐴 ∈ ω → ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩ ∈ ran (𝑄 ↾ ω))
5554, 37syl6eleqr 2712 . . 3 (𝐴 ∈ ω → ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩ ∈ (𝑄 “ ω))
56 df-br 4654 . . 3 (suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴)) ↔ ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩ ∈ (𝑄 “ ω))
5755, 56sylibr 224 . 2 (𝐴 ∈ ω → suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴)))
58 fnbrfvb 6236 . . 3 (((𝑄 “ ω) Fn ω ∧ suc 𝐴 ∈ ω) → (((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)) ↔ suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴))))
5941, 1, 58sylancr 695 . 2 (𝐴 ∈ ω → (((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)) ↔ suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴))))
6057, 59mpbird 247 1 (𝐴 ∈ ω → ((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1483  wcel 1990  Vcvv 3200  c0 3915  cop 4183   class class class wbr 4653   I cid 5023  ran crn 5115  cres 5116  cima 5117  suc csuc 5725   Fn wfn 5883  cfv 5888  (class class class)co 6650  cmpt2 6652  ωcom 7065  2nd c2nd 7167  reccrdg 7505
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506
This theorem is referenced by:  seqomsuc  7552
  Copyright terms: Public domain W3C validator