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

Theorem chfnrn 5704
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 5639 . . . . 5 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
21biimpd 144 . . . 4 (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 (𝐹𝑥) = 𝑦))
3 eleq1 2269 . . . . . . 7 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝑥𝑦𝑥))
43biimpcd 159 . . . . . 6 ((𝐹𝑥) ∈ 𝑥 → ((𝐹𝑥) = 𝑦𝑦𝑥))
54ralimi 2570 . . . . 5 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → ∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥))
6 rexim 2601 . . . . 5 (∀𝑥𝐴 ((𝐹𝑥) = 𝑦𝑦𝑥) → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
75, 6syl 14 . . . 4 (∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥 → (∃𝑥𝐴 (𝐹𝑥) = 𝑦 → ∃𝑥𝐴 𝑦𝑥))
82, 7sylan9 409 . . 3 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥𝐴 𝑦𝑥))
9 eluni2 3860 . . 3 (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥)
108, 9imbitrrdi 162 . 2 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹𝑦 𝐴))
1110ssrdv 3203 1 ((𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝑥) → ran 𝐹 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wcel 2177  wral 2485  wrex 2486  wss 3170   cuni 3856  ran crn 4684   Fn wfn 5275  cfv 5280
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3003  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-br 4052  df-opab 4114  df-mpt 4115  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-rn 4694  df-iota 5241  df-fun 5282  df-fn 5283  df-fv 5288
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator