Theorem imain 5402

Description: The image of an intersection is the intersection of images. (Contributed by Paul Chapman, 11-Apr-2009.)

Assertion

Ref	Expression
imain	⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∩ 𝐵)) = ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)))

Proof of Theorem imain

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

Step	Hyp	Ref	Expression
1		imainlem 5401	. . 3 ⊢ (𝐹 “ (𝐴 ∩ 𝐵)) ⊆ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵))
2	1	a1i 9	. 2 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∩ 𝐵)) ⊆ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)))
3		eeanv 1983	. . . . . 6 ⊢ (∃𝑥∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)))
4		simprll 537	. . . . . . . . . . 11 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 ∈ 𝐴)
5		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) → 𝑥𝐹𝑦)
6		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦) → 𝑧𝐹𝑦)
7	5, 6	anim12i 338	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → (𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦))
8		funcnveq 5383	. . . . . . . . . . . . . . . . 17 ⊢ (Fun ◡𝐹 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
9	8	biimpi 120	. . . . . . . . . . . . . . . 16 ⊢ (Fun ◡𝐹 → ∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
10	9	19.21bi 1604	. . . . . . . . . . . . . . 15 ⊢ (Fun ◡𝐹 → ∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
11	10	19.21bbi 1605	. . . . . . . . . . . . . 14 ⊢ (Fun ◡𝐹 → ((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
12	11	imp 124	. . . . . . . . . . . . 13 ⊢ ((Fun ◡𝐹 ∧ (𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦)) → 𝑥 = 𝑧)
13	7, 12	sylan2 286	. . . . . . . . . . . 12 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 = 𝑧)
14		simprrl 539	. . . . . . . . . . . 12 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑧 ∈ 𝐵)
15	13, 14	eqeltrd 2306	. . . . . . . . . . 11 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 ∈ 𝐵)
16		elin 3387	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
17	4, 15, 16	sylanbrc 417	. . . . . . . . . 10 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 ∈ (𝐴 ∩ 𝐵))
18		simprlr 538	. . . . . . . . . 10 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥𝐹𝑦)
19	17, 18	jca 306	. . . . . . . . 9 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦))
20	19	ex 115	. . . . . . . 8 ⊢ (Fun ◡𝐹 → (((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
21	20	exlimdv 1865	. . . . . . 7 ⊢ (Fun ◡𝐹 → (∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
22	21	eximdv 1926	. . . . . 6 ⊢ (Fun ◡𝐹 → (∃𝑥∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
23	3, 22	biimtrrid 153	. . . . 5 ⊢ (Fun ◡𝐹 → ((∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
24		df-rex 2514	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))
25		df-rex 2514	. . . . . 6 ⊢ (∃𝑧 ∈ 𝐵 𝑧𝐹𝑦 ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))
26	24, 25	anbi12i 460	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)))
27		df-rex 2514	. . . . 5 ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦))
28	23, 26, 27	3imtr4g 205	. . . 4 ⊢ (Fun ◡𝐹 → ((∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦))
29	28	ss2abdv 3297	. . 3 ⊢ (Fun ◡𝐹 → {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦)} ⊆ {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦})
30		dfima2 5069	. . . . 5 ⊢ (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦}
31		dfima2 5069	. . . . 5 ⊢ (𝐹 “ 𝐵) = {𝑦 ∣ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦}
32	30, 31	ineq12i 3403	. . . 4 ⊢ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)) = ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦} ∩ {𝑦 ∣ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦})
33		inab 3472	. . . 4 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦} ∩ {𝑦 ∣ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦}) = {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦)}
34	32, 33	eqtri 2250	. . 3 ⊢ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)) = {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦)}
35		dfima2 5069	. . 3 ⊢ (𝐹 “ (𝐴 ∩ 𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦}
36	29, 34, 35	3sstr4g 3267	. 2 ⊢ (Fun ◡𝐹 → ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∩ 𝐵)))
37	2, 36	eqssd 3241	1 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∩ 𝐵)) = ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1393   = wceq 1395  ∃wex 1538   ∈ wcel 2200  {cab 2215  ∃wrex 2509   ∩ cin 3196   ⊆ wss 3197   class class class wbr 4082  ^◡ccnv 4717   “ cima 4721  Fun wfun 5311

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4083  df-opab 4145  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-fun 5319

This theorem is referenced by:  inpreima  5760