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

Theorem orderseqlem 8049
Description: Lemma for poseq 8050 and soseq 8051. The function value of a sequence is either in 𝐴 or null. (Contributed by Scott Fenton, 8-Jun-2011.)
Hypothesis
Ref Expression
orderseqlem.1 𝐹 = {𝑓 ∣ ∃𝑥 ∈ On 𝑓:𝑥𝐴}
Assertion
Ref Expression
orderseqlem (𝐺𝐹 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
Distinct variable groups:   𝐴,𝑓,𝑥   𝑓,𝐺,𝑥   𝑥,𝑋
Allowed substitution hints:   𝐹(𝑥,𝑓)   𝑋(𝑓)

Proof of Theorem orderseqlem
StepHypRef Expression
1 feq1 6637 . . . . 5 (𝑓 = 𝐺 → (𝑓:𝑥𝐴𝐺:𝑥𝐴))
21rexbidv 3172 . . . 4 (𝑓 = 𝐺 → (∃𝑥 ∈ On 𝑓:𝑥𝐴 ↔ ∃𝑥 ∈ On 𝐺:𝑥𝐴))
3 orderseqlem.1 . . . 4 𝐹 = {𝑓 ∣ ∃𝑥 ∈ On 𝑓:𝑥𝐴}
42, 3elab2g 3625 . . 3 (𝐺𝐹 → (𝐺𝐹 ↔ ∃𝑥 ∈ On 𝐺:𝑥𝐴))
54ibi 267 . 2 (𝐺𝐹 → ∃𝑥 ∈ On 𝐺:𝑥𝐴)
6 frn 6663 . . . . 5 (𝐺:𝑥𝐴 → ran 𝐺𝐴)
7 unss1 4131 . . . . 5 (ran 𝐺𝐴 → (ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}))
86, 7syl 17 . . . 4 (𝐺:𝑥𝐴 → (ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}))
9 fvrn0 6860 . . . 4 (𝐺𝑋) ∈ (ran 𝐺 ∪ {∅})
10 ssel 3929 . . . 4 ((ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}) → ((𝐺𝑋) ∈ (ran 𝐺 ∪ {∅}) → (𝐺𝑋) ∈ (𝐴 ∪ {∅})))
118, 9, 10mpisyl 21 . . 3 (𝐺:𝑥𝐴 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
1211rexlimivw 3145 . 2 (∃𝑥 ∈ On 𝐺:𝑥𝐴 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
135, 12syl 17 1 (𝐺𝐹 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2106  {cab 2714  wrex 3071  cun 3900  wss 3902  c0 4274  {csn 4578  ran crn 5626  Oncon0 6307  wf 6480  cfv 6484
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-sep 5248  ax-nul 5255  ax-pr 5377
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3405  df-v 3444  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4275  df-if 4479  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4858  df-br 5098  df-opab 5160  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6436  df-fun 6486  df-fn 6487  df-f 6488  df-fv 6492
This theorem is referenced by:  poseq  8050  soseq  8051
  Copyright terms: Public domain W3C validator