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

Theorem chfnrn 6994
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 6894 . . . . 5 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
21biimpd 229 . . . 4 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
3 eleq1 2824 . . . . . . 7 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝑥𝑦𝑥))
43biimpcd 249 . . . . . 6 ((𝐹𝑥) ∈ 𝑥 → ((𝐹𝑥) = 𝑦𝑦𝑥))
54ralimi 3073 . . . . 5 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → ∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥))
6 rexim 3077 . . . . 5 (∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥) → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
75, 6syl 17 . . . 4 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
82, 7sylan9 507 . . 3 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 𝑦𝑥))
9 eluni2 4867 . . 3 (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥)
108, 9imbitrrdi 252 . 2 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹𝑦 𝐴))
1110ssrdv 3939 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → ran 𝐹 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3051  wrex 3060  wss 3901   cuni 4863  ran crn 5625   Fn wfn 6487  cfv 6492
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-fv 6500
This theorem is referenced by:  stoweidlem59  46303
  Copyright terms: Public domain W3C validator