| 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 6887 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) | |
| 2 | 1 | biimpd 230 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) |
| 3 | eleq1 2827 | . . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝑥 ↔ 𝑦 ∈ 𝑥)) | |
| 4 | 3 | biimpcd 250 | . . . . . 6 ⊢ ((𝐹‘𝑥) ∈ 𝑥 → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
| 5 | 4 | ralimi 3076 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
| 6 | rexim 3080 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥) → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) | |
| 7 | 5, 6 | syl 17 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
| 8 | 2, 7 | sylan9 512 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
| 9 | eluni2 4842 | . . 3 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 10 | 8, 9 | imbitrrdi 253 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ∪ 𝐴)) |
| 11 | 10 | ssrdv 3921 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → ran 𝐹 ⊆ ∪ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ∃wrex 3063 ⊆ wss 3883 ∪ cuni 4838 ran crn 5619 Fn wfn 6480 ‘cfv 6485 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-iota 6441 df-fun 6487 df-fn 6488 df-fv 6493 |
| This theorem is referenced by: stoweidlem59 46502 |
| Copyright terms: Public domain | W3C validator |