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

Theorem orderseqlem 8107
Description: Lemma for poseq 8108 and soseq 8109. 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 6646 . . . . 5 (𝑓 = 𝐺 → (𝑓:𝑥𝐴𝐺:𝑥𝐴))
21rexbidv 3161 . . . 4 (𝑓 = 𝐺 → (∃𝑥 ∈ On 𝑓:𝑥𝐴 ↔ ∃𝑥 ∈ On 𝐺:𝑥𝐴))
3 orderseqlem.1 . . . 4 𝐹 = {𝑓 ∣ ∃𝑥 ∈ On 𝑓:𝑥𝐴}
42, 3elab2g 3623 . . 3 (𝐺𝐹 → (𝐺𝐹 ↔ ∃𝑥 ∈ On 𝐺:𝑥𝐴))
54ibi 267 . 2 (𝐺𝐹 → ∃𝑥 ∈ On 𝐺:𝑥𝐴)
6 frn 6675 . . . . 5 (𝐺:𝑥𝐴 → ran 𝐺𝐴)
7 unss1 4125 . . . . 5 (ran 𝐺𝐴 → (ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}))
86, 7syl 17 . . . 4 (𝐺:𝑥𝐴 → (ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}))
9 fvrn0 6868 . . . 4 (𝐺𝑋) ∈ (ran 𝐺 ∪ {∅})
10 ssel 3915 . . . 4 ((ran 𝐺 ∪ {∅}) ⊆ (𝐴 ∪ {∅}) → ((𝐺𝑋) ∈ (ran 𝐺 ∪ {∅}) → (𝐺𝑋) ∈ (𝐴 ∪ {∅})))
118, 9, 10mpisyl 21 . . 3 (𝐺:𝑥𝐴 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
1211rexlimivw 3134 . 2 (∃𝑥 ∈ On 𝐺:𝑥𝐴 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
135, 12syl 17 1 (𝐺𝐹 → (𝐺𝑋) ∈ (𝐴 ∪ {∅}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  {cab 2714  wrex 3061  cun 3887  wss 3889  c0 4273  {csn 4567  ran crn 5632  Oncon0 6323  wf 6494  cfv 6498
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506
This theorem is referenced by:  poseq  8108  soseq  8109
  Copyright terms: Public domain W3C validator