difmap - Mathbox for Glauco Siliprandi

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

Theorem difmap 41836

Description: Difference of two sets exponentiations. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

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

**Assertion**
Ref	Expression
difmap	⊢ (𝜑 → ((𝐴 ∖ 𝐵) ↑_m 𝐶) ⊆ ((𝐴 ↑_m 𝐶) ∖ (𝐵 ↑_m 𝐶)))

Proof of Theorem difmap Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difmap.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		difssd 4060	. . . . . . 7 ⊢ (𝜑 → (𝐴 ∖ 𝐵) ⊆ 𝐴)
3		mapss 8436	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ∖ 𝐵) ⊆ 𝐴) → ((𝐴 ∖ 𝐵) ↑_m 𝐶) ⊆ (𝐴 ↑_m 𝐶))
4	1, 2, 3	syl2anc 587	. . . . . 6 ⊢ (𝜑 → ((𝐴 ∖ 𝐵) ↑_m 𝐶) ⊆ (𝐴 ↑_m 𝐶))
5	4	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → ((𝐴 ∖ 𝐵) ↑_m 𝐶) ⊆ (𝐴 ↑_m 𝐶))
6		simpr 488	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶))
7	5, 6	sseldd 3916	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → 𝑓 ∈ (𝐴 ↑_m 𝐶))
8		difmap.n	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ≠ ∅)
9		n0 4260	. . . . . . . 8 ⊢ (𝐶 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐶)
10	8, 9	sylib 221	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐶)
11	10	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → ∃𝑥 𝑥 ∈ 𝐶)
12		simpr 488	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑓:𝐶⟶𝐵) → 𝑓:𝐶⟶𝐵)
13		simpl 486	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑓:𝐶⟶𝐵) → 𝑥 ∈ 𝐶)
14	12, 13	ffvelrnd 6829	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑓:𝐶⟶𝐵) → (𝑓‘𝑥) ∈ 𝐵)
15	14	adantll 713	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) ∧ 𝑥 ∈ 𝐶) ∧ 𝑓:𝐶⟶𝐵) → (𝑓‘𝑥) ∈ 𝐵)
16		elmapi 8411	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶) → 𝑓:𝐶⟶(𝐴 ∖ 𝐵))
17	16	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶) ∧ 𝑥 ∈ 𝐶) → 𝑓:𝐶⟶(𝐴 ∖ 𝐵))
18		simpr 488	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶) ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐶)
19	17, 18	ffvelrnd 6829	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶) ∧ 𝑥 ∈ 𝐶) → (𝑓‘𝑥) ∈ (𝐴 ∖ 𝐵))
20		eldifn 4055	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑥) ∈ (𝐴 ∖ 𝐵) → ¬ (𝑓‘𝑥) ∈ 𝐵)
21	19, 20	syl 17	. . . . . . . . . 10 ⊢ ((𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶) ∧ 𝑥 ∈ 𝐶) → ¬ (𝑓‘𝑥) ∈ 𝐵)
22	21	ad4ant23 752	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) ∧ 𝑥 ∈ 𝐶) ∧ 𝑓:𝐶⟶𝐵) → ¬ (𝑓‘𝑥) ∈ 𝐵)
23	15, 22	pm2.65da 816	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) ∧ 𝑥 ∈ 𝐶) → ¬ 𝑓:𝐶⟶𝐵)
24	23	ex 416	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → (𝑥 ∈ 𝐶 → ¬ 𝑓:𝐶⟶𝐵))
25	24	exlimdv 1934	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → (∃𝑥 𝑥 ∈ 𝐶 → ¬ 𝑓:𝐶⟶𝐵))
26	11, 25	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → ¬ 𝑓:𝐶⟶𝐵)
27		difmap.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
28		difmap.v	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑍)
29		elmapg 8402	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑍) → (𝑓 ∈ (𝐵 ↑_m 𝐶) ↔ 𝑓:𝐶⟶𝐵))
30	27, 28, 29	syl2anc 587	. . . . . 6 ⊢ (𝜑 → (𝑓 ∈ (𝐵 ↑_m 𝐶) ↔ 𝑓:𝐶⟶𝐵))
31	30	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → (𝑓 ∈ (𝐵 ↑_m 𝐶) ↔ 𝑓:𝐶⟶𝐵))
32	26, 31	mtbird 328	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → ¬ 𝑓 ∈ (𝐵 ↑_m 𝐶))
33	7, 32	eldifd 3892	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)) → 𝑓 ∈ ((𝐴 ↑_m 𝐶) ∖ (𝐵 ↑_m 𝐶)))
34	33	ralrimiva 3149	. 2 ⊢ (𝜑 → ∀𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)𝑓 ∈ ((𝐴 ↑_m 𝐶) ∖ (𝐵 ↑_m 𝐶)))
35		dfss3 3903	. 2 ⊢ (((𝐴 ∖ 𝐵) ↑_m 𝐶) ⊆ ((𝐴 ↑_m 𝐶) ∖ (𝐵 ↑_m 𝐶)) ↔ ∀𝑓 ∈ ((𝐴 ∖ 𝐵) ↑_m 𝐶)𝑓 ∈ ((𝐴 ↑_m 𝐶) ∖ (𝐵 ↑_m 𝐶)))
36	34, 35	sylibr 237	1 ⊢ (𝜑 → ((𝐴 ∖ 𝐵) ↑_m 𝐶) ⊆ ((𝐴 ↑_m 𝐶) ∖ (𝐵 ↑_m 𝐶)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∃wex 1781 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ∖ cdif 3878 ⊆ wss 3881 ∅c0 4243 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ↑_m cmap 8389

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-map 8391

This theorem is referenced by: difmapsn 41841

W3C validator