ixpssmapc - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ixpssmapc		Structured version Visualization version GIF version

Theorem ixpssmapc 45077

Description: An infinite Cartesian product is a subset of set exponentiation. (Contributed by Glauco Siliprandi, 24-Dec-2020.)

**Hypotheses**
Ref	Expression
ixpssmapc.x	⊢ Ⅎ𝑥𝜑
ixpssmapc.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
ixpssmapc.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)

**Assertion**
Ref	Expression
ixpssmapc	⊢ (𝜑 → X𝑥 ∈ 𝐴 𝐵 ⊆ (𝐶 ↑_m 𝐴))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐶 Allowed substitution hints: 𝜑(𝑥) 𝐵(𝑥) 𝑉(𝑥)

**Proof of Theorem ixpssmapc**
Step	Hyp	Ref	Expression
1		ixpssmapc.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
2		ixpssmapc.x	. . . . . 6 ⊢ Ⅎ𝑥𝜑
3		ixpssmapc.b	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ 𝐶)
4	3	ex 412	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 ⊆ 𝐶))
5	2, 4	ralrimi 3244	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
6		iunss 5026	. . . . 5 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7	5, 6	sylibr 234	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
8	1, 7	ssexd 5299	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V)
9		ixpssmap2g 8946	. . 3 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∈ V → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
10	8, 9	syl 17	. 2 ⊢ (𝜑 → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
11		mapss 8908	. . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ⊆ (𝐶 ↑_m 𝐴))
12	1, 7, 11	syl2anc 584	. 2 ⊢ (𝜑 → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ⊆ (𝐶 ↑_m 𝐴))
13	10, 12	sstrd 3974	1 ⊢ (𝜑 → X𝑥 ∈ 𝐴 𝐵 ⊆ (𝐶 ↑_m 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 Ⅎwnf 1783 ∈ wcel 2109 ∀wral 3052 Vcvv 3464 ⊆ wss 3931 ∪ ciun 4972 (class class class)co 7410 ↑_m cmap 8845 Xcixp 8916

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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7993 df-2nd 7994 df-map 8847 df-ixp 8917

This theorem is referenced by: ioorrnopnlem 46313

W3C validator