Theorem imadif 5059

Description: The image of a difference is the difference of images. (Contributed by NM, 24-May-1998.)

Assertion

Ref	Expression
imadif	⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∖ 𝐵)) = ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)))

Proof of Theorem imadif

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		anandir 556	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
2	1	exbii 1539	. . . . . . 7 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦) ↔ ∃𝑥((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
3		19.40 1565	. . . . . . 7 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)) → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑥(¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
4	2, 3	sylbi 119	. . . . . 6 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦) → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑥(¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
5		nfv 1464	. . . . . . . . . . 11 ⊢ Ⅎ𝑥Fun ◡𝐹
6		nfe1 1428	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵)
7	5, 6	nfan 1500	. . . . . . . . . 10 ⊢ Ⅎ𝑥(Fun ◡𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵))
8		funmo 4996	. . . . . . . . . . . . . 14 ⊢ (Fun ◡𝐹 → ∃*𝑥 𝑦◡𝐹𝑥)
9		vex 2618	. . . . . . . . . . . . . . . 16 ⊢ 𝑦 ∈ V
10		vex 2618	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
11	9, 10	brcnv 4587	. . . . . . . . . . . . . . 15 ⊢ (𝑦◡𝐹𝑥 ↔ 𝑥𝐹𝑦)
12	11	mobii 1982	. . . . . . . . . . . . . 14 ⊢ (∃*𝑥 𝑦◡𝐹𝑥 ↔ ∃*𝑥 𝑥𝐹𝑦)
13	8, 12	sylib 120	. . . . . . . . . . . . 13 ⊢ (Fun ◡𝐹 → ∃*𝑥 𝑥𝐹𝑦)
14		mopick 2023	. . . . . . . . . . . . 13 ⊢ ((∃*𝑥 𝑥𝐹𝑦 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵)) → (𝑥𝐹𝑦 → ¬ 𝑥 ∈ 𝐵))
15	13, 14	sylan 277	. . . . . . . . . . . 12 ⊢ ((Fun ◡𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵)) → (𝑥𝐹𝑦 → ¬ 𝑥 ∈ 𝐵))
16	15	con2d 587	. . . . . . . . . . 11 ⊢ ((Fun ◡𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵)) → (𝑥 ∈ 𝐵 → ¬ 𝑥𝐹𝑦))
17		imnan 657	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐵 → ¬ 𝑥𝐹𝑦) ↔ ¬ (𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
18	16, 17	sylib 120	. . . . . . . . . 10 ⊢ ((Fun ◡𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵)) → ¬ (𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
19	7, 18	alrimi 1458	. . . . . . . . 9 ⊢ ((Fun ◡𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵)) → ∀𝑥 ¬ (𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
20	19	ex 113	. . . . . . . 8 ⊢ (Fun ◡𝐹 → (∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵) → ∀𝑥 ¬ (𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
21		exancom 1542	. . . . . . . 8 ⊢ (∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥 ∈ 𝐵) ↔ ∃𝑥(¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
22		alnex 1431	. . . . . . . 8 ⊢ (∀𝑥 ¬ (𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦) ↔ ¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
23	20, 21, 22	3imtr3g 202	. . . . . . 7 ⊢ (Fun ◡𝐹 → (∃𝑥(¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦) → ¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
24	23	anim2d 330	. . . . . 6 ⊢ (Fun ◡𝐹 → ((∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑥(¬ 𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)) → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))))
25	4, 24	syl5 32	. . . . 5 ⊢ (Fun ◡𝐹 → (∃𝑥((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦) → (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))))
26		df-rex 2361	. . . . . 6 ⊢ (∃𝑥 ∈ (𝐴 ∖ 𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥𝐹𝑦))
27		eldif 2997	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
28	27	anbi1i 446	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦))
29	28	exbii 1539	. . . . . 6 ⊢ (∃𝑥(𝑥 ∈ (𝐴 ∖ 𝐵) ∧ 𝑥𝐹𝑦) ↔ ∃𝑥((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦))
30	26, 29	bitri 182	. . . . 5 ⊢ (∃𝑥 ∈ (𝐴 ∖ 𝐵)𝑥𝐹𝑦 ↔ ∃𝑥((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ∧ 𝑥𝐹𝑦))
31		df-rex 2361	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))
32		df-rex 2361	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐵 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
33	32	notbii 627	. . . . . 6 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦 ↔ ¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦))
34	31, 33	anbi12i 448	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥𝐹𝑦)))
35	25, 30, 34	3imtr4g 203	. . . 4 ⊢ (Fun ◡𝐹 → (∃𝑥 ∈ (𝐴 ∖ 𝐵)𝑥𝐹𝑦 → (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦)))
36	35	ss2abdv 3083	. . 3 ⊢ (Fun ◡𝐹 → {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∖ 𝐵)𝑥𝐹𝑦} ⊆ {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦)})
37		dfima2 4743	. . 3 ⊢ (𝐹 “ (𝐴 ∖ 𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∖ 𝐵)𝑥𝐹𝑦}
38		dfima2 4743	. . . . 5 ⊢ (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦}
39		dfima2 4743	. . . . 5 ⊢ (𝐹 “ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦}
40	38, 39	difeq12i 3105	. . . 4 ⊢ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) = ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦})
41		difab 3257	. . . 4 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦}) = {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦)}
42	40, 41	eqtri 2105	. . 3 ⊢ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) = {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥 ∈ 𝐵 𝑥𝐹𝑦)}
43	36, 37, 42	3sstr4g 3056	. 2 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∖ 𝐵)) ⊆ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)))
44		imadiflem 5058	. . 3 ⊢ ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵))
45	44	a1i 9	. 2 ⊢ (Fun ◡𝐹 → ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∖ 𝐵)))
46	43, 45	eqssd 3031	1 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∖ 𝐵)) = ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 102  ∀wal 1285   = wceq 1287  ∃wex 1424   ∈ wcel 1436  ∃*wmo 1946  {cab 2071  ∃wrex 2356   ∖ cdif 2985   ⊆ wss 2988   class class class wbr 3820  ^◡ccnv 4410   “ cima 4414  Fun wfun 4975

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-sep 3932  ax-pow 3984  ax-pr 4010

This theorem depends on definitions:  df-bi 115  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ral 2360  df-rex 2361  df-rab 2364  df-v 2617  df-dif 2990  df-un 2992  df-in 2994  df-ss 3001  df-pw 3417  df-sn 3437  df-pr 3438  df-op 3440  df-br 3821  df-opab 3875  df-id 4094  df-xp 4417  df-rel 4418  df-cnv 4419  df-co 4420  df-dm 4421  df-rn 4422  df-res 4423  df-ima 4424  df-fun 4983

This theorem is referenced by:  resdif  5238  difpreima  5389  phplem4  6523  phplem4dom  6530  phplem4on  6535