| 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 418 | . . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 ∈ 𝑊)) |
| 5 | 1, 4 | ralrimi 3264 | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) |
| 6 | iunexg 8009 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) | |
| 7 | 2, 5, 6 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
| 9 | ssiun2 5011 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) | |
| 10 | 9 | adantl 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 11 | mapss 8955 | . . . . 5 ⊢ ((∪ 𝑥 ∈ 𝐴 𝐵 ∈ V ∧ 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) | |
| 12 | 8, 10, 11 | syl2anc 596 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
| 13 | 12 | ex 418 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶))) |
| 14 | 1, 13 | ralrimi 3264 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
| 15 | nfiu1 4991 | . . . 4 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵 | |
| 16 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑥 ↑m | |
| 17 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑥𝐶 | |
| 18 | 15, 16, 17 | nfov 7481 | . . 3 ⊢ Ⅎ𝑥(∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶) |
| 19 | 18 | iunssf 5006 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
| 20 | 14, 19 | sylibr 237 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 Ⅎwnf 1816 ∈ wcel 2147 ∀wral 3080 Vcvv 3454 ⊆ wss 3900 ∪ ciun 4956 (class class class)co 7451 ↑m cmap 8885 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-map 8887 |
| This theorem is used by: iunmapsn 46503 |
| Copyright terms: Public domain | W3C validator |