Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > uniimaelsetpreimafv | Structured version Visualization version GIF version |
Description: The union of the image of an element of the preimage of a function value is an element of the range of the function. (Contributed by AV, 5-Mar-2024.) (Revised by AV, 22-Mar-2024.) |
Ref | Expression |
---|---|
setpreimafvex.p | ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} |
Ref | Expression |
---|---|
uniimaelsetpreimafv | ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → ∪ (𝐹 “ 𝑆) ∈ ran 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | setpreimafvex.p | . . . . 5 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})} | |
2 | 1 | 0nelsetpreimafv 43624 | . . . 4 ⊢ (𝐹 Fn 𝐴 → ∅ ∉ 𝑃) |
3 | elnelne2 3133 | . . . . . 6 ⊢ ((𝑆 ∈ 𝑃 ∧ ∅ ∉ 𝑃) → 𝑆 ≠ ∅) | |
4 | n0 4303 | . . . . . 6 ⊢ (𝑆 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝑆) | |
5 | 3, 4 | sylib 220 | . . . . 5 ⊢ ((𝑆 ∈ 𝑃 ∧ ∅ ∉ 𝑃) → ∃𝑦 𝑦 ∈ 𝑆) |
6 | 5 | expcom 416 | . . . 4 ⊢ (∅ ∉ 𝑃 → (𝑆 ∈ 𝑃 → ∃𝑦 𝑦 ∈ 𝑆)) |
7 | 2, 6 | syl 17 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝑆 ∈ 𝑃 → ∃𝑦 𝑦 ∈ 𝑆)) |
8 | 7 | imp 409 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → ∃𝑦 𝑦 ∈ 𝑆) |
9 | 1 | imaelsetpreimafv 43629 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃 ∧ 𝑦 ∈ 𝑆) → (𝐹 “ 𝑆) = {(𝐹‘𝑦)}) |
10 | 9 | 3expa 1113 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → (𝐹 “ 𝑆) = {(𝐹‘𝑦)}) |
11 | 10 | unieqd 4845 | . . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → ∪ (𝐹 “ 𝑆) = ∪ {(𝐹‘𝑦)}) |
12 | fvex 6676 | . . . . 5 ⊢ (𝐹‘𝑦) ∈ V | |
13 | 12 | unisn 4851 | . . . 4 ⊢ ∪ {(𝐹‘𝑦)} = (𝐹‘𝑦) |
14 | 11, 13 | syl6eq 2871 | . . 3 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → ∪ (𝐹 “ 𝑆) = (𝐹‘𝑦)) |
15 | dffn3 6518 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹) | |
16 | 15 | biimpi 218 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → 𝐹:𝐴⟶ran 𝐹) |
17 | 16 | ad2antrr 724 | . . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → 𝐹:𝐴⟶ran 𝐹) |
18 | 1 | elsetpreimafvssdm 43620 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → 𝑆 ⊆ 𝐴) |
19 | 18 | sselda 3960 | . . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝐴) |
20 | 17, 19 | ffvelrnd 6845 | . . 3 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → (𝐹‘𝑦) ∈ ran 𝐹) |
21 | 14, 20 | eqeltrd 2912 | . 2 ⊢ (((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) ∧ 𝑦 ∈ 𝑆) → ∪ (𝐹 “ 𝑆) ∈ ran 𝐹) |
22 | 8, 21 | exlimddv 1935 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → ∪ (𝐹 “ 𝑆) ∈ ran 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∃wex 1779 ∈ wcel 2113 {cab 2798 ≠ wne 3015 ∉ wnel 3122 ∃wrex 3138 ∅c0 4284 {csn 4560 ∪ cuni 4831 ◡ccnv 5547 ran crn 5549 “ cima 5551 Fn wfn 6343 ⟶wf 6344 ‘cfv 6348 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pr 5323 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-rab 3146 df-v 3493 df-sbc 3769 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5060 df-opab 5122 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-fv 6356 |
This theorem is referenced by: imasetpreimafvbijlemf 43635 fundcmpsurbijinjpreimafv 43641 |
Copyright terms: Public domain | W3C validator |