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

Theorem seqomlem4 7435
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 6978 . . . . . . 7 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 fvres 6117 . . . . . . 7 (suc 𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) = (𝑄‘suc 𝐴))
31, 2syl 17 . . . . . 6 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) = (𝑄‘suc 𝐴))
4 frsuc 7419 . . . . . . . 8 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝐴) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴)))
5 fvres 6117 . . . . . . . . . 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 6104 . . . . . . . . 9 (𝑄‘suc 𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘suc 𝐴)
96, 8syl6eqr 2662 . . . . . . . 8 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘suc 𝐴) = (𝑄‘suc 𝐴))
10 fvres 6117 . . . . . . . . . 10 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘𝐴))
117fveq1i 6104 . . . . . . . . . 10 (𝑄𝐴) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩)‘𝐴)
1210, 11syl6eqr 2662 . . . . . . . . 9 (𝐴 ∈ ω → ((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴) = (𝑄𝐴))
1312fveq2d 6107 . . . . . . . 8 (𝐴 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘((rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)‘𝐴)) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝐴)))
144, 9, 133eqtr3d 2652 . . . . . . 7 (𝐴 ∈ ω → (𝑄‘suc 𝐴) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝐴)))
157seqomlem1 7432 . . . . . . . 8 (𝐴 ∈ ω → (𝑄𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
1615fveq2d 6107 . . . . . . 7 (𝐴 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘(𝑄𝐴)) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝐴, (2nd ‘(𝑄𝐴))⟩))
17 df-ov 6552 . . . . . . . 8 (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
18 fvex 6113 . . . . . . . . . 10 (2nd ‘(𝑄𝐴)) ∈ V
19 suceq 5707 . . . . . . . . . . . 12 (𝑖 = 𝐴 → suc 𝑖 = suc 𝐴)
20 oveq1 6556 . . . . . . . . . . . 12 (𝑖 = 𝐴 → (𝑖𝐹𝑣) = (𝐴𝐹𝑣))
2119, 20opeq12d 4348 . . . . . . . . . . 11 (𝑖 = 𝐴 → ⟨suc 𝑖, (𝑖𝐹𝑣)⟩ = ⟨suc 𝐴, (𝐴𝐹𝑣)⟩)
22 oveq2 6557 . . . . . . . . . . . 12 (𝑣 = (2nd ‘(𝑄𝐴)) → (𝐴𝐹𝑣) = (𝐴𝐹(2nd ‘(𝑄𝐴))))
2322opeq2d 4347 . . . . . . . . . . 11 (𝑣 = (2nd ‘(𝑄𝐴)) → ⟨suc 𝐴, (𝐴𝐹𝑣)⟩ = ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩)
24 eqid 2610 . . . . . . . . . . 11 (𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩) = (𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)
25 opex 4859 . . . . . . . . . . 11 ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩ ∈ V
2621, 23, 24, 25ovmpt2 6694 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ (2nd ‘(𝑄𝐴)) ∈ V) → (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩)
2718, 26mpan2 703 . . . . . . . . 9 (𝐴 ∈ ω → (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩)
28 fvres 6117 . . . . . . . . . . . . . . . . 17 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘𝐴) = (𝑄𝐴))
2928, 15eqtrd 2644 . . . . . . . . . . . . . . . 16 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘𝐴) = ⟨𝐴, (2nd ‘(𝑄𝐴))⟩)
30 frfnom 7417 . . . . . . . . . . . . . . . . . 18 (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω) Fn ω
317reseq1i 5313 . . . . . . . . . . . . . . . . . . 19 (𝑄 ↾ ω) = (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω)
3231fneq1i 5899 . . . . . . . . . . . . . . . . . 18 ((𝑄 ↾ ω) Fn ω ↔ (rec((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩), ⟨∅, ( I ‘𝐼)⟩) ↾ ω) Fn ω)
3330, 32mpbir 220 . . . . . . . . . . . . . . . . 17 (𝑄 ↾ ω) Fn ω
34 fnfvelrn 6264 . . . . . . . . . . . . . . . . 17 (((𝑄 ↾ ω) Fn ω ∧ 𝐴 ∈ ω) → ((𝑄 ↾ ω)‘𝐴) ∈ ran (𝑄 ↾ ω))
3533, 34mpan 702 . . . . . . . . . . . . . . . 16 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘𝐴) ∈ ran (𝑄 ↾ ω))
3629, 35eqeltrrd 2689 . . . . . . . . . . . . . . 15 (𝐴 ∈ ω → ⟨𝐴, (2nd ‘(𝑄𝐴))⟩ ∈ ran (𝑄 ↾ ω))
37 df-ima 5051 . . . . . . . . . . . . . . 15 (𝑄 “ ω) = ran (𝑄 ↾ ω)
3836, 37syl6eleqr 2699 . . . . . . . . . . . . . 14 (𝐴 ∈ ω → ⟨𝐴, (2nd ‘(𝑄𝐴))⟩ ∈ (𝑄 “ ω))
39 df-br 4584 . . . . . . . . . . . . . 14 (𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴)) ↔ ⟨𝐴, (2nd ‘(𝑄𝐴))⟩ ∈ (𝑄 “ ω))
4038, 39sylibr 223 . . . . . . . . . . . . 13 (𝐴 ∈ ω → 𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴)))
417seqomlem2 7433 . . . . . . . . . . . . . 14 (𝑄 “ ω) Fn ω
42 fnbrfvb 6146 . . . . . . . . . . . . . 14 (((𝑄 “ ω) Fn ω ∧ 𝐴 ∈ ω) → (((𝑄 “ ω)‘𝐴) = (2nd ‘(𝑄𝐴)) ↔ 𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴))))
4341, 42mpan 702 . . . . . . . . . . . . 13 (𝐴 ∈ ω → (((𝑄 “ ω)‘𝐴) = (2nd ‘(𝑄𝐴)) ↔ 𝐴(𝑄 “ ω)(2nd ‘(𝑄𝐴))))
4440, 43mpbird 246 . . . . . . . . . . . 12 (𝐴 ∈ ω → ((𝑄 “ ω)‘𝐴) = (2nd ‘(𝑄𝐴)))
4544eqcomd 2616 . . . . . . . . . . 11 (𝐴 ∈ ω → (2nd ‘(𝑄𝐴)) = ((𝑄 “ ω)‘𝐴))
4645oveq2d 6565 . . . . . . . . . 10 (𝐴 ∈ ω → (𝐴𝐹(2nd ‘(𝑄𝐴))) = (𝐴𝐹((𝑄 “ ω)‘𝐴)))
4746opeq2d 4347 . . . . . . . . 9 (𝐴 ∈ ω → ⟨suc 𝐴, (𝐴𝐹(2nd ‘(𝑄𝐴)))⟩ = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
4827, 47eqtrd 2644 . . . . . . . 8 (𝐴 ∈ ω → (𝐴(𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)(2nd ‘(𝑄𝐴))) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
4917, 48syl5eqr 2658 . . . . . . 7 (𝐴 ∈ ω → ((𝑖 ∈ ω, 𝑣 ∈ V ↦ ⟨suc 𝑖, (𝑖𝐹𝑣)⟩)‘⟨𝐴, (2nd ‘(𝑄𝐴))⟩) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
5014, 16, 493eqtrd 2648 . . . . . 6 (𝐴 ∈ ω → (𝑄‘suc 𝐴) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
513, 50eqtrd 2644 . . . . 5 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) = ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩)
52 fnfvelrn 6264 . . . . . 6 (((𝑄 ↾ ω) Fn ω ∧ suc 𝐴 ∈ ω) → ((𝑄 ↾ ω)‘suc 𝐴) ∈ ran (𝑄 ↾ ω))
5333, 1, 52sylancr 694 . . . . 5 (𝐴 ∈ ω → ((𝑄 ↾ ω)‘suc 𝐴) ∈ ran (𝑄 ↾ ω))
5451, 53eqeltrrd 2689 . . . 4 (𝐴 ∈ ω → ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩ ∈ ran (𝑄 ↾ ω))
5554, 37syl6eleqr 2699 . . 3 (𝐴 ∈ ω → ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩ ∈ (𝑄 “ ω))
56 df-br 4584 . . 3 (suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴)) ↔ ⟨suc 𝐴, (𝐴𝐹((𝑄 “ ω)‘𝐴))⟩ ∈ (𝑄 “ ω))
5755, 56sylibr 223 . 2 (𝐴 ∈ ω → suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴)))
58 fnbrfvb 6146 . . 3 (((𝑄 “ ω) Fn ω ∧ suc 𝐴 ∈ ω) → (((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)) ↔ suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴))))
5941, 1, 58sylancr 694 . 2 (𝐴 ∈ ω → (((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)) ↔ suc 𝐴(𝑄 “ ω)(𝐴𝐹((𝑄 “ ω)‘𝐴))))
6057, 59mpbird 246 1 (𝐴 ∈ ω → ((𝑄 “ ω)‘suc 𝐴) = (𝐴𝐹((𝑄 “ ω)‘𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195   = wceq 1475  wcel 1977  Vcvv 3173  c0 3874  cop 4131   class class class wbr 4583   I cid 4948  ran crn 5039  cres 5040  cima 5041  suc csuc 5642   Fn wfn 5799  cfv 5804  (class class class)co 6549  cmpt2 6551  ωcom 6957  2nd c2nd 7058  reccrdg 7392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393
This theorem is referenced by:  seqomsuc  7439
  Copyright terms: Public domain W3C validator