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 45427

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 3236	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
6		iunss 5002	. . . . 5 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7	5, 6	sylibr 234	. . . 4 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
8	1, 7	ssexd 5271	. . 3 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ∈ V)
9		ixpssmap2g 8877	. . 3 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∈ V → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
10	8, 9	syl 17	. 2 ⊢ (𝜑 → X𝑥 ∈ 𝐴 𝐵 ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴))
11		mapss 8839	. . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ⊆ (𝐶 ↑_m 𝐴))
12	1, 7, 11	syl2anc 585	. 2 ⊢ (𝜑 → (∪ 𝑥 ∈ 𝐴 𝐵 ↑_m 𝐴) ⊆ (𝐶 ↑_m 𝐴))
13	10, 12	sstrd 3946	1 ⊢ (𝜑 → X𝑥 ∈ 𝐴 𝐵 ⊆ (𝐶 ↑_m 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 Ⅎwnf 1785 ∈ wcel 2114 ∀wral 3052 Vcvv 3442 ⊆ wss 3903 ∪ ciun 4948 (class class class)co 7368 ↑_m cmap 8775 Xcixp 8847

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-map 8777 df-ixp 8848

This theorem is referenced by: ioorrnopnlem 46656

W3C validator