Theorem ssimaex 5482

Description: The existence of a subimage. (Contributed by NM, 8-Apr-2007.)

Hypothesis

Ref	Expression
ssimaex.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
ssimaex	⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹

Proof of Theorem ssimaex

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

Step	Hyp	Ref	Expression
1		dmres 4840	. . . . 5 ⊢ dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
2	1	imaeq2i 4879	. . . 4 ⊢ (𝐹 “ dom (𝐹 ↾ 𝐴)) = (𝐹 “ (𝐴 ∩ dom 𝐹))
3		imadmres 5031	. . . 4 ⊢ (𝐹 “ dom (𝐹 ↾ 𝐴)) = (𝐹 “ 𝐴)
4	2, 3	eqtr3i 2162	. . 3 ⊢ (𝐹 “ (𝐴 ∩ dom 𝐹)) = (𝐹 “ 𝐴)
5	4	sseq2i 3124	. 2 ⊢ (𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹)) ↔ 𝐵 ⊆ (𝐹 “ 𝐴))
6		ssrab2 3182	. . . 4 ⊢ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ⊆ (𝐴 ∩ dom 𝐹)
7		ssel2 3092	. . . . . . . . 9 ⊢ ((𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹)) ∧ 𝑧 ∈ 𝐵) → 𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹)))
8	7	adantll 467	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) ∧ 𝑧 ∈ 𝐵) → 𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹)))
9		fvelima 5473	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹))) → ∃𝑤 ∈ (𝐴 ∩ dom 𝐹)(𝐹‘𝑤) = 𝑧)
10	9	ex 114	. . . . . . . . . . 11 ⊢ (Fun 𝐹 → (𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹)) → ∃𝑤 ∈ (𝐴 ∩ dom 𝐹)(𝐹‘𝑤) = 𝑧))
11	10	adantr 274	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ 𝐵) → (𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹)) → ∃𝑤 ∈ (𝐴 ∩ dom 𝐹)(𝐹‘𝑤) = 𝑧))
12		eleq1a 2211	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝐵 → ((𝐹‘𝑤) = 𝑧 → (𝐹‘𝑤) ∈ 𝐵))
13	12	anim2d 335	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝐵 → ((𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) = 𝑧) → (𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) ∈ 𝐵)))
14		fveq2 5421	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑤 → (𝐹‘𝑦) = (𝐹‘𝑤))
15	14	eleq1d 2208	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑤 → ((𝐹‘𝑦) ∈ 𝐵 ↔ (𝐹‘𝑤) ∈ 𝐵))
16	15	elrab 2840	. . . . . . . . . . . . . . 15 ⊢ (𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ↔ (𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) ∈ 𝐵))
17	13, 16	syl6ibr 161	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐵 → ((𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) = 𝑧) → 𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}))
18		simpr 109	. . . . . . . . . . . . . . 15 ⊢ ((𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) = 𝑧) → (𝐹‘𝑤) = 𝑧)
19	18	a1i 9	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ 𝐵 → ((𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) = 𝑧) → (𝐹‘𝑤) = 𝑧))
20	17, 19	jcad 305	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝐵 → ((𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) = 𝑧) → (𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ∧ (𝐹‘𝑤) = 𝑧)))
21	20	reximdv2 2531	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝐵 → (∃𝑤 ∈ (𝐴 ∩ dom 𝐹)(𝐹‘𝑤) = 𝑧 → ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
22	21	adantl 275	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ 𝐵) → (∃𝑤 ∈ (𝐴 ∩ dom 𝐹)(𝐹‘𝑤) = 𝑧 → ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
23		funfn 5153	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
24		inss2 3297	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∩ dom 𝐹) ⊆ dom 𝐹
25	6, 24	sstri 3106	. . . . . . . . . . . . . 14 ⊢ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ⊆ dom 𝐹
26		fvelimab 5477	. . . . . . . . . . . . . 14 ⊢ ((𝐹 Fn dom 𝐹 ∧ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ⊆ dom 𝐹) → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) ↔ ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
27	25, 26	mpan2 421	. . . . . . . . . . . . 13 ⊢ (𝐹 Fn dom 𝐹 → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) ↔ ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
28	23, 27	sylbi 120	. . . . . . . . . . . 12 ⊢ (Fun 𝐹 → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) ↔ ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
29	28	adantr 274	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ 𝐵) → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) ↔ ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
30	22, 29	sylibrd 168	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ 𝐵) → (∃𝑤 ∈ (𝐴 ∩ dom 𝐹)(𝐹‘𝑤) = 𝑧 → 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})))
31	11, 30	syld 45	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ 𝐵) → (𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹)) → 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})))
32	31	adantlr 468	. . . . . . . 8 ⊢ (((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) ∧ 𝑧 ∈ 𝐵) → (𝑧 ∈ (𝐹 “ (𝐴 ∩ dom 𝐹)) → 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})))
33	8, 32	mpd 13	. . . . . . 7 ⊢ (((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) ∧ 𝑧 ∈ 𝐵) → 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}))
34	33	ex 114	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) → (𝑧 ∈ 𝐵 → 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})))
35		fvelima 5473	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})) → ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧)
36	35	ex 114	. . . . . . . 8 ⊢ (Fun 𝐹 → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) → ∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧))
37		eleq1 2202	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑤) = 𝑧 → ((𝐹‘𝑤) ∈ 𝐵 ↔ 𝑧 ∈ 𝐵))
38	37	biimpcd 158	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑤) ∈ 𝐵 → ((𝐹‘𝑤) = 𝑧 → 𝑧 ∈ 𝐵))
39	38	adantl 275	. . . . . . . . . 10 ⊢ ((𝑤 ∈ (𝐴 ∩ dom 𝐹) ∧ (𝐹‘𝑤) ∈ 𝐵) → ((𝐹‘𝑤) = 𝑧 → 𝑧 ∈ 𝐵))
40	16, 39	sylbi 120	. . . . . . . . 9 ⊢ (𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} → ((𝐹‘𝑤) = 𝑧 → 𝑧 ∈ 𝐵))
41	40	rexlimiv 2543	. . . . . . . 8 ⊢ (∃𝑤 ∈ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} (𝐹‘𝑤) = 𝑧 → 𝑧 ∈ 𝐵)
42	36, 41	syl6 33	. . . . . . 7 ⊢ (Fun 𝐹 → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) → 𝑧 ∈ 𝐵))
43	42	adantr 274	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) → (𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}) → 𝑧 ∈ 𝐵))
44	34, 43	impbid 128	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})))
45	44	eqrdv 2137	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) → 𝐵 = (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}))
46		ssimaex.1	. . . . . . 7 ⊢ 𝐴 ∈ V
47	46	inex1 4062	. . . . . 6 ⊢ (𝐴 ∩ dom 𝐹) ∈ V
48	47	rabex 4072	. . . . 5 ⊢ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ∈ V
49		sseq1 3120	. . . . . 6 ⊢ (𝑥 = {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} → (𝑥 ⊆ (𝐴 ∩ dom 𝐹) ↔ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ⊆ (𝐴 ∩ dom 𝐹)))
50		imaeq2 4877	. . . . . . 7 ⊢ (𝑥 = {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} → (𝐹 “ 𝑥) = (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}))
51	50	eqeq2d 2151	. . . . . 6 ⊢ (𝑥 = {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} → (𝐵 = (𝐹 “ 𝑥) ↔ 𝐵 = (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})))
52	49, 51	anbi12d 464	. . . . 5 ⊢ (𝑥 = {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} → ((𝑥 ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ 𝑥)) ↔ ({𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵}))))
53	48, 52	spcev 2780	. . . 4 ⊢ (({𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵} ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ {𝑦 ∈ (𝐴 ∩ dom 𝐹) ∣ (𝐹‘𝑦) ∈ 𝐵})) → ∃𝑥(𝑥 ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ 𝑥)))
54	6, 45, 53	sylancr 410	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) → ∃𝑥(𝑥 ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ 𝑥)))
55		inss1 3296	. . . . . 6 ⊢ (𝐴 ∩ dom 𝐹) ⊆ 𝐴
56		sstr 3105	. . . . . 6 ⊢ ((𝑥 ⊆ (𝐴 ∩ dom 𝐹) ∧ (𝐴 ∩ dom 𝐹) ⊆ 𝐴) → 𝑥 ⊆ 𝐴)
57	55, 56	mpan2 421	. . . . 5 ⊢ (𝑥 ⊆ (𝐴 ∩ dom 𝐹) → 𝑥 ⊆ 𝐴)
58	57	anim1i 338	. . . 4 ⊢ ((𝑥 ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ 𝑥)) → (𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))
59	58	eximi 1579	. . 3 ⊢ (∃𝑥(𝑥 ⊆ (𝐴 ∩ dom 𝐹) ∧ 𝐵 = (𝐹 “ 𝑥)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))
60	54, 59	syl 14	. 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ (𝐴 ∩ dom 𝐹))) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))
61	5, 60	sylan2br 286	1 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ (𝐹 “ 𝐴)) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝐵 = (𝐹 “ 𝑥)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331  ∃wex 1468   ∈ wcel 1480  ∃wrex 2417  {crab 2420  Vcvv 2686   ∩ cin 3070   ⊆ wss 3071  dom cdm 4539   ↾ cres 4541   “ cima 4542  Fun wfun 5117   Fn wfn 5118  ‘cfv 5123

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131

This theorem is referenced by:  ssimaexg  5483