| 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 6942 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) | |
| 2 | 1 | biimpd 232 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)) |
| 3 | eleq1 2857 | . . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝑥 ↔ 𝑦 ∈ 𝑥)) | |
| 4 | 3 | biimpcd 252 | . . . . . 6 ⊢ ((𝐹‘𝑥) ∈ 𝑥 → ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
| 5 | 4 | ralimi 3108 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → ∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥)) |
| 6 | rexim 3112 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ((𝐹‘𝑥) = 𝑦 → 𝑦 ∈ 𝑥) → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) | |
| 7 | 5, 6 | syl 18 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
| 8 | 2, 7 | sylan9 516 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥)) |
| 9 | eluni2 4880 | . . 3 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥) | |
| 10 | 8, 9 | imbitrrdi 255 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ∪ 𝐴)) |
| 11 | 10 | ssrdv 3951 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝑥) → ran 𝐹 ⊆ ∪ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ∃wrex 3095 ⊆ wss 3913 ∪ cuni 4876 ran crn 5663 Fn wfn 6532 ‘cfv 6537 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-iota 6493 df-fun 6539 df-fn 6540 df-fv 6545 |
| This theorem is referenced by: stoweidlem59 46664 |
| Copyright terms: Public domain | W3C validator |