Theorem imain 5350

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 5349	. . 3 ⊢ (𝐹 “ (𝐴 ∩ 𝐵)) ⊆ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵))
2	1	a1i 9	. 2 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∩ 𝐵)) ⊆ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)))
3		eeanv 1959	. . . . . 6 ⊢ (∃𝑥∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)))
4		simprll 537	. . . . . . . . . . 11 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 ∈ 𝐴)
5		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) → 𝑥𝐹𝑦)
6		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦) → 𝑧𝐹𝑦)
7	5, 6	anim12i 338	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → (𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦))
8		funcnveq 5331	. . . . . . . . . . . . . . . . 17 ⊢ (Fun ◡𝐹 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
9	8	biimpi 120	. . . . . . . . . . . . . . . 16 ⊢ (Fun ◡𝐹 → ∀𝑥∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
10	9	19.21bi 1580	. . . . . . . . . . . . . . 15 ⊢ (Fun ◡𝐹 → ∀𝑦∀𝑧((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
11	10	19.21bbi 1581	. . . . . . . . . . . . . 14 ⊢ (Fun ◡𝐹 → ((𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦) → 𝑥 = 𝑧))
12	11	imp 124	. . . . . . . . . . . . 13 ⊢ ((Fun ◡𝐹 ∧ (𝑥𝐹𝑦 ∧ 𝑧𝐹𝑦)) → 𝑥 = 𝑧)
13	7, 12	sylan2 286	. . . . . . . . . . . 12 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 = 𝑧)
14		simprrl 539	. . . . . . . . . . . 12 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑧 ∈ 𝐵)
15	13, 14	eqeltrd 2281	. . . . . . . . . . 11 ⊢ ((Fun ◡𝐹 ∧ ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))) → 𝑥 ∈ 𝐵)
16		elin 3355	. . . . . . . . . . 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 1841	. . . . . . 7 ⊢ (Fun ◡𝐹 → (∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
22	21	eximdv 1902	. . . . . 6 ⊢ (Fun ◡𝐹 → (∃𝑥∃𝑧((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ (𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
23	3, 22	biimtrrid 153	. . . . 5 ⊢ (Fun ◡𝐹 → ((∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦)))
24		df-rex 2489	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))
25		df-rex 2489	. . . . . 6 ⊢ (∃𝑧 ∈ 𝐵 𝑧𝐹𝑦 ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦))
26	24, 25	anbi12i 460	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ∧ ∃𝑧(𝑧 ∈ 𝐵 ∧ 𝑧𝐹𝑦)))
27		df-rex 2489	. . . . 5 ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥𝐹𝑦))
28	23, 26, 27	3imtr4g 205	. . . 4 ⊢ (Fun ◡𝐹 → ((∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦))
29	28	ss2abdv 3265	. . 3 ⊢ (Fun ◡𝐹 → {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦)} ⊆ {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦})
30		dfima2 5021	. . . . 5 ⊢ (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦}
31		dfima2 5021	. . . . 5 ⊢ (𝐹 “ 𝐵) = {𝑦 ∣ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦}
32	30, 31	ineq12i 3371	. . . 4 ⊢ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)) = ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦} ∩ {𝑦 ∣ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦})
33		inab 3440	. . . 4 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥𝐹𝑦} ∩ {𝑦 ∣ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦}) = {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦)}
34	32, 33	eqtri 2225	. . 3 ⊢ ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)) = {𝑦 ∣ (∃𝑥 ∈ 𝐴 𝑥𝐹𝑦 ∧ ∃𝑧 ∈ 𝐵 𝑧𝐹𝑦)}
35		dfima2 5021	. . 3 ⊢ (𝐹 “ (𝐴 ∩ 𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝐹𝑦}
36	29, 34, 35	3sstr4g 3235	. 2 ⊢ (Fun ◡𝐹 → ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)) ⊆ (𝐹 “ (𝐴 ∩ 𝐵)))
37	2, 36	eqssd 3209	1 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∩ 𝐵)) = ((𝐹 “ 𝐴) ∩ (𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1370   = wceq 1372  ∃wex 1514   ∈ wcel 2175  {cab 2190  ∃wrex 2484   ∩ cin 3164   ⊆ wss 3165   class class class wbr 4043  ^◡ccnv 4672   “ cima 4676  Fun wfun 5262

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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-br 4044  df-opab 4105  df-id 4338  df-xp 4679  df-rel 4680  df-cnv 4681  df-co 4682  df-dm 4683  df-rn 4684  df-res 4685  df-ima 4686  df-fun 5270

This theorem is referenced by:  inpreima  5700