| 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 3260 | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) |
| 6 | iunexg 7960 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) | |
| 7 | 2, 5, 6 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
| 9 | ssiun2 5006 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) | |
| 10 | 9 | adantl 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 11 | mapss 8896 | . . . . 5 ⊢ ((∪ 𝑥 ∈ 𝐴 𝐵 ∈ V ∧ 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) | |
| 12 | 8, 10, 11 | syl2anc 596 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
| 13 | 12 | ex 418 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶))) |
| 14 | 1, 13 | ralrimi 3260 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐵 ↑m 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶)) |
| 15 | nfiu1 4986 | . . . 4 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵 | |
| 16 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑥 ↑m | |
| 17 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑥𝐶 | |
| 18 | 15, 16, 17 | nfov 7443 | . . 3 ⊢ Ⅎ𝑥(∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶) |
| 19 | 18 | iunssf 5001 | . 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 2145 ∀wral 3076 Vcvv 3450 ⊆ wss 3899 ∪ ciun 4951 (class class class)co 7413 ↑m cmap 8826 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-map 8828 |
| This theorem is used by: iunmapsn 46047 |
| Copyright terms: Public domain | W3C validator |