Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > iunmapss | Structured version Visualization version GIF version |
Description: The indexed union of set exponentiations is a subset of the set exponentiation of the indexed union. (Contributed by Glauco Siliprandi, 3-Mar-2021.) |
Ref | Expression |
---|---|
iunmapss.x | ⊢ Ⅎ𝑥𝜑 |
iunmapss.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
iunmapss.b | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊) |
Ref | Expression |
---|---|
iunmapss | ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunmapss.x | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | iunmapss.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
3 | iunmapss.b | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊) | |
4 | 3 | ex 415 | . . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 ∈ 𝑊)) |
5 | 1, 4 | ralrimi 3219 | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) |
6 | iunexg 7667 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) | |
7 | 2, 5, 6 | syl2anc 586 | . . . . . 6 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
8 | 7 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
9 | ssiun2 4974 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) | |
10 | 9 | adantl 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
11 | mapss 8456 | . . . . 5 ⊢ ((∪ 𝑥 ∈ 𝐴 𝐵 ∈ V ∧ 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) | |
12 | 8, 10, 11 | syl2anc 586 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
13 | 12 | ex 415 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶))) |
14 | 1, 13 | ralrimi 3219 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
15 | nfiu1 4956 | . . . 4 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵 | |
16 | nfcv 2980 | . . . 4 ⊢ Ⅎ𝑥 ↑m | |
17 | nfcv 2980 | . . . 4 ⊢ Ⅎ𝑥𝐶 | |
18 | 15, 16, 17 | nfov 7189 | . . 3 ⊢ Ⅎ𝑥(∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶) |
19 | 18 | iunssf 41358 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
20 | 14, 19 | sylibr 236 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 Ⅎwnf 1783 ∈ wcel 2113 ∀wral 3141 Vcvv 3497 ⊆ wss 3939 ∪ ciun 4922 (class class class)co 7159 ↑m cmap 8409 |
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-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
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-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 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-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-1st 7692 df-2nd 7693 df-map 8411 |
This theorem is referenced by: iunmapsn 41486 |
Copyright terms: Public domain | W3C validator |