| 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 7976 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) | |
| 7 | 2, 5, 6 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V) |
| 9 | ssiun2 5005 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) | |
| 10 | 9 | adantl 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) |
| 11 | mapss 8921 | . . . . 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 4985 | . . . 4 ⊢ Ⅎ𝑥∪ 𝑥 ∈ 𝐴 𝐵 | |
| 16 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑥 ↑m | |
| 17 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑥𝐶 | |
| 18 | 15, 16, 17 | nfov 7451 | . . 3 ⊢ Ⅎ𝑥(∪ 𝑥 ∈ 𝐴 𝐵 ↑m 𝐶) |
| 19 | 18 | iunssf 5000 | . 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 1815 ∈ wcel 2144 ∀wral 3076 Vcvv 3450 ⊆ wss 3895 ∪ ciun 4950 (class class class)co 7421 ↑m cmap 8851 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-map 8853 |
| This theorem is used by: iunmapsn 46324 |
| Copyright terms: Public domain | W3C validator |