| 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 6895 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) | |
| 2 | 1 | biimpd 229 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) |
| 3 | eleq1 2825 | . . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝑥 ↔ 𝑦 ∈ 𝑥)) | |
| 4 | 3 | biimpcd 249 | . . . . . 6 ⊢ ((𝐹‘𝑥) ∈ 𝑥 → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
| 5 | 4 | ralimi 3075 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
| 6 | rexim 3079 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥) → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) | |
| 7 | 5, 6 | syl 17 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
| 8 | 2, 7 | sylan9 507 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
| 9 | eluni2 4855 | . . 3 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 10 | 8, 9 | imbitrrdi 252 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ∪ 𝐴)) |
| 11 | 10 | ssrdv 3928 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → ran 𝐹 ⊆ ∪ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 ⊆ wss 3890 ∪ cuni 4851 ran crn 5626 Fn wfn 6488 ‘cfv 6493 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-iota 6449 df-fun 6495 df-fn 6496 df-fv 6501 |
| This theorem is referenced by: stoweidlem59 46508 |
| Copyright terms: Public domain | W3C validator |