mapssbi - Mathbox for Glauco Siliprandi

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

Theorem mapssbi 45179

Description: Subset inheritance for set exponentiation. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

**Hypotheses**
Ref	Expression
mapssbi.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
mapssbi.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
mapssbi.c	⊢ (𝜑 → 𝐶 ∈ 𝑍)
mapssbi.n	⊢ (𝜑 → 𝐶 ≠ ∅)

**Assertion**
Ref	Expression
mapssbi	⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)))

Proof of Theorem mapssbi Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mapssbi.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
2	1	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ⊆ 𝐵) → 𝐵 ∈ 𝑊)
3		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ⊆ 𝐵) → 𝐴 ⊆ 𝐵)
4		mapss 8866	. . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ⊆ 𝐵) → (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
5	2, 3, 4	syl2anc 584	. . 3 ⊢ ((𝜑 ∧ 𝐴 ⊆ 𝐵) → (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
6	5	ex 412	. 2 ⊢ (𝜑 → (𝐴 ⊆ 𝐵 → (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)))
7		simplr 768	. . . 4 ⊢ (((𝜑 ∧ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)) ∧ ¬ 𝐴 ⊆ 𝐵) → (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
8		nssrex 45052	. . . . . . . 8 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)
9	8	biimpi 216	. . . . . . 7 ⊢ (¬ 𝐴 ⊆ 𝐵 → ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)
10	9	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 ⊆ 𝐵) → ∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)
11		fconst6g 6756	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 → (𝐶 × {𝑥}):𝐶⟶𝐴)
12	11	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 × {𝑥}):𝐶⟶𝐴)
13		mapssbi.a	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
14		mapssbi.c	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ∈ 𝑍)
15		elmapg 8816	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑍) → ((𝐶 × {𝑥}) ∈ (𝐴 ↑_m 𝐶) ↔ (𝐶 × {𝑥}):𝐶⟶𝐴))
16	13, 14, 15	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐶 × {𝑥}) ∈ (𝐴 ↑_m 𝐶) ↔ (𝐶 × {𝑥}):𝐶⟶𝐴))
17	16	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐶 × {𝑥}) ∈ (𝐴 ↑_m 𝐶) ↔ (𝐶 × {𝑥}):𝐶⟶𝐴))
18	12, 17	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 × {𝑥}) ∈ (𝐴 ↑_m 𝐶))
19	18	3adant3 1132	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (𝐶 × {𝑥}) ∈ (𝐴 ↑_m 𝐶))
20	14	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → 𝐶 ∈ 𝑍)
21	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → 𝐵 ∈ 𝑊)
22		mapssbi.n	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐶 ≠ ∅)
23	22	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → 𝐶 ≠ ∅)
24		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶))
25	20, 21, 23, 24	snelmap 45048	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → 𝑥 ∈ 𝐵)
26	25	adantlr 715	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ 𝑥 ∈ 𝐵) ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → 𝑥 ∈ 𝐵)
27		simplr 768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ 𝑥 ∈ 𝐵) ∧ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → ¬ 𝑥 ∈ 𝐵)
28	26, 27	pm2.65da 816	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐵) → ¬ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶))
29	28	3adant2 1131	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → ¬ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶))
30		nelss 4020	. . . . . . . . . 10 ⊢ (((𝐶 × {𝑥}) ∈ (𝐴 ↑_m 𝐶) ∧ ¬ (𝐶 × {𝑥}) ∈ (𝐵 ↑_m 𝐶)) → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
31	19, 29, 30	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
32	31	3exp 1119	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (¬ 𝑥 ∈ 𝐵 → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))))
33	32	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐴 ⊆ 𝐵) → (𝑥 ∈ 𝐴 → (¬ 𝑥 ∈ 𝐵 → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))))
34	33	rexlimdv 3134	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 ⊆ 𝐵) → (∃𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵 → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)))
35	10, 34	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
36	35	adantlr 715	. . . 4 ⊢ (((𝜑 ∧ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)) ∧ ¬ 𝐴 ⊆ 𝐵) → ¬ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶))
37	7, 36	condan 817	. . 3 ⊢ ((𝜑 ∧ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)) → 𝐴 ⊆ 𝐵)
38	37	ex 412	. 2 ⊢ (𝜑 → ((𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶) → 𝐴 ⊆ 𝐵))
39	6, 38	impbid 212	1 ⊢ (𝜑 → (𝐴 ⊆ 𝐵 ↔ (𝐴 ↑_m 𝐶) ⊆ (𝐵 ↑_m 𝐶)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2109 ≠ wne 2927 ∃wrex 3055 ⊆ wss 3922 ∅c0 4304 {csn 4597 × cxp 5644 ⟶wf 6515 (class class class)co 7394 ↑_m cmap 8803

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 2702 ax-sep 5259 ax-nul 5269 ax-pow 5328 ax-pr 5395 ax-un 7718

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2880 df-ne 2928 df-ral 3047 df-rex 3056 df-rab 3412 df-v 3457 df-sbc 3762 df-csb 3871 df-dif 3925 df-un 3927 df-in 3929 df-ss 3939 df-nul 4305 df-if 4497 df-pw 4573 df-sn 4598 df-pr 4600 df-op 4604 df-uni 4880 df-iun 4965 df-br 5116 df-opab 5178 df-mpt 5197 df-id 5541 df-xp 5652 df-rel 5653 df-cnv 5654 df-co 5655 df-dm 5656 df-rn 5657 df-res 5658 df-ima 5659 df-iota 6472 df-fun 6521 df-fn 6522 df-f 6523 df-fv 6527 df-ov 7397 df-oprab 7398 df-mpo 7399 df-1st 7977 df-2nd 7978 df-map 8805

This theorem is referenced by: (None)

W3C validator