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

Theorem chfnrn 6977
Description: The range of a choice function (a function that chooses an element from each member of its domain) is included in the union of its domain. (Contributed by NM, 31-Aug-1999.)
Assertion
Ref Expression
chfnrn ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → ran 𝐹 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem chfnrn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fvelrnb 6877 . . . . 5 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
21biimpd 229 . . . 4 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
3 eleq1 2819 . . . . . . 7 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝑥𝑦𝑥))
43biimpcd 249 . . . . . 6 ((𝐹𝑥) ∈ 𝑥 → ((𝐹𝑥) = 𝑦𝑦𝑥))
54ralimi 3069 . . . . 5 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → ∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥))
6 rexim 3073 . . . . 5 (∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥) → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
75, 6syl 17 . . . 4 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
82, 7sylan9 507 . . 3 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 𝑦𝑥))
9 eluni2 4858 . . 3 (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥)
108, 9imbitrrdi 252 . 2 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹𝑦 𝐴))
1110ssrdv 3935 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → ran 𝐹 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  wral 3047  wrex 3056  wss 3897   cuni 4854  ran crn 5612   Fn wfn 6471  cfv 6476
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-iota 6432  df-fun 6478  df-fn 6479  df-fv 6484
This theorem is referenced by:  stoweidlem59  46097
  Copyright terms: Public domain W3C validator