![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > chfnrn | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
chfnrn | ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → ran 𝐹 ⊆ ∪ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvelrnb 6701 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) | |
2 | 1 | biimpd 232 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) |
3 | eleq1 2877 | . . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝑥 ↔ 𝑦 ∈ 𝑥)) | |
4 | 3 | biimpcd 252 | . . . . . 6 ⊢ ((𝐹‘𝑥) ∈ 𝑥 → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
5 | 4 | ralimi 3128 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
6 | rexim 3204 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥) → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) | |
7 | 5, 6 | syl 17 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
8 | 2, 7 | sylan9 511 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
9 | eluni2 4804 | . . 3 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) | |
10 | 8, 9 | syl6ibr 255 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ∪ 𝐴)) |
11 | 10 | ssrdv 3921 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → ran 𝐹 ⊆ ∪ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 ⊆ wss 3881 ∪ cuni 4800 ran crn 5520 Fn wfn 6319 ‘cfv 6324 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-fv 6332 |
This theorem is referenced by: stoweidlem59 42701 |
Copyright terms: Public domain | W3C validator |