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

Theorem orderseqlem 8198
Description: Lemma for poseq 8199 and soseq 8200. 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 6728 . . . . 5 (𝑓 = 𝐺 → (𝑓:𝑥𝐴𝐺:𝑥𝐴))
21rexbidv 3185 . . . 4 (𝑓 = 𝐺 → (∃𝑥 ∈ On 𝑓:𝑥𝐴 ↔ ∃𝑥 ∈ On 𝐺:𝑥𝐴))
3 orderseqlem.1 . . . 4 𝐹 = {𝑓 ∣ ∃𝑥 ∈ On 𝑓:𝑥𝐴}
42, 3elab2g 3696 . . 3 (𝐺𝐹 → (𝐺𝐹 ↔ ∃𝑥 ∈ On 𝐺:𝑥𝐴))
54ibi 267 . 2 (𝐺𝐹 → ∃𝑥 ∈ On 𝐺:𝑥𝐴)
6 frn 6754 . . . . 5 (𝐺:𝑥𝐴 → ran 𝐺𝐴)
7 unss1 4208 . . . . 5 (ran 𝐺𝐴 → (ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}))
86, 7syl 17 . . . 4 (𝐺:𝑥𝐴 → (ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}))
9 fvrn0 6950 . . . 4 (𝐺𝑋) ∈ (ran 𝐺 ∪ {∅})
10 ssel 4002 . . . 4 ((ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}) → ((𝐺𝑋) ∈ (ran 𝐺 ∪ {∅}) → (𝐺𝑋) ∈ (𝐴 ∪ {∅})))
118, 9, 10mpisyl 21 . . 3 (𝐺:𝑥𝐴 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
1211rexlimivw 3157 . 2 (∃𝑥 ∈ On 𝐺:𝑥𝐴 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
135, 12syl 17 1 (𝐺𝐹 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2108  {cab 2717  wrex 3076  cun 3974  wss 3976  c0 4352  {csn 4648  ran crn 5701  Oncon0 6395  wf 6569  cfv 6573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581
This theorem is referenced by:  poseq  8199  soseq  8200
  Copyright terms: Public domain W3C validator