ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  chfnrn GIF version

Theorem chfnrn 5745
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 5680 . . . . 5 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
21biimpd 144 . . . 4 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
3 eleq1 2292 . . . . . . 7 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝑥𝑦𝑥))
43biimpcd 159 . . . . . 6 ((𝐹𝑥) ∈ 𝑥 → ((𝐹𝑥) = 𝑦𝑦𝑥))
54ralimi 2593 . . . . 5 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → ∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥))
6 rexim 2624 . . . . 5 (∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥) → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
75, 6syl 14 . . . 4 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
82, 7sylan9 409 . . 3 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 𝑦𝑥))
9 eluni2 3891 . . 3 (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥)
108, 9imbitrrdi 162 . 2 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹𝑦 𝐴))
1110ssrdv 3230 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → ran 𝐹 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wral 2508  wrex 2509  wss 3197   cuni 3887  ran crn 4719   Fn wfn 5312  cfv 5317
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-iota 5277  df-fun 5319  df-fn 5320  df-fv 5325
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator