Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > founiiun | Structured version Visualization version GIF version |
Description: Union expressed as an indexed union, when a map onto is given. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
Ref | Expression |
---|---|
founiiun | ⊢ (𝐹:𝐴–onto→𝐵 → ∪ 𝐵 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uniiun 4985 | . 2 ⊢ ∪ 𝐵 = ∪ 𝑦 ∈ 𝐵 𝑦 | |
2 | foelrni 6730 | . . . . . 6 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦) | |
3 | eqimss2 4027 | . . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → 𝑦 ⊆ (𝐹‘𝑥)) | |
4 | 3 | reximi 3246 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥)) |
5 | 2, 4 | syl 17 | . . . . 5 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥)) |
6 | 5 | ralrimiva 3185 | . . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥)) |
7 | iunss2 4976 | . . . 4 ⊢ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥) → ∪ 𝑦 ∈ 𝐵 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝐹:𝐴–onto→𝐵 → ∪ 𝑦 ∈ 𝐵 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)) |
9 | fof 6593 | . . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵) | |
10 | 9 | ffvelrnda 6854 | . . . . . 6 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) |
11 | ssidd 3993 | . . . . . 6 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ⊆ (𝐹‘𝑥)) | |
12 | sseq2 3996 | . . . . . . 7 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝑥) ⊆ 𝑦 ↔ (𝐹‘𝑥) ⊆ (𝐹‘𝑥))) | |
13 | 12 | rspcev 3626 | . . . . . 6 ⊢ (((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ (𝐹‘𝑥)) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦) |
14 | 10, 11, 13 | syl2anc 586 | . . . . 5 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦) |
15 | 14 | ralrimiva 3185 | . . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦) |
16 | iunss2 4976 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦) | |
17 | 15, 16 | syl 17 | . . 3 ⊢ (𝐹:𝐴–onto→𝐵 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦) |
18 | 8, 17 | eqssd 3987 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 → ∪ 𝑦 ∈ 𝐵 𝑦 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)) |
19 | 1, 18 | syl5eq 2871 | 1 ⊢ (𝐹:𝐴–onto→𝐵 → ∪ 𝐵 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ∃wrex 3142 ⊆ wss 3939 ∪ cuni 4841 ∪ ciun 4922 –onto→wfo 6356 ‘cfv 6358 |
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 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-fo 6364 df-fv 6366 |
This theorem is referenced by: founiiun0 41457 issalnnd 42635 caragenunicl 42813 isomenndlem 42819 |
Copyright terms: Public domain | W3C validator |