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

Theorem chfnrn 7079
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 6976 . . . . 5 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦))
21biimpd 232 . . . 4 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦))
3 eleq1 2852 . . . . . . 7 ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
43biimpcd 252 . . . . . 6 ((𝐹‘𝑥) ∈ 𝑥 → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥))
54ralimi 3103 . . . . 5 (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥))
6 rexim 3107 . . . . 5 (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥) → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥))
75, 6syl 18 . . . 4 (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥))
82, 7sylan9 517 . . 3 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥))
9 eluni2 4876 . . 3 (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)
108, 9imbitrrdi 255 . 2 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ∪ 𝐴))
1110ssrdv 3919 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → ran 𝐹 ⊆ ∪ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∪ cuni 4872  ran crn 5659   Fn wfn 6561  ‘cfv 6566
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574
This theorem is used by:  stoweidlem59  47342
  Copyright terms: Public domain W3C validator