Theorem imadifssranOLD 6198

Description: Obsolete version of imadifssran 6197 as of 10-Jul-2026. (Contributed by AV, 4-Oct-2025.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
imadifssranOLD	⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ((𝐹 “ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ran 𝐹 = ran (𝐹 ↾ 𝐴)))

Proof of Theorem imadifssranOLD

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ima 5668	. . 3 ⊢ (𝐹 “ (dom 𝐹 ∖ 𝐴)) = ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))
2	1	sseq1i 3959	. 2 ⊢ ((𝐹 “ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) ↔ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴))
3		ssel 3925	. . . . . . 7 ⊢ (ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → (𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
4		resdm 6019	. . . . . . . . . . . . . . 15 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
5	4	eqcomd 2766	. . . . . . . . . . . . . 14 ⊢ (Rel 𝐹 → 𝐹 = (𝐹 ↾ dom 𝐹))
6	5	adantr 486	. . . . . . . . . . . . 13 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → 𝐹 = (𝐹 ↾ dom 𝐹))
7	6	rneqd 5922	. . . . . . . . . . . 12 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ran 𝐹 = ran (𝐹 ↾ dom 𝐹))
8	7	eleq2d 2846	. . . . . . . . . . 11 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 ↔ 𝑦 ∈ ran (𝐹 ↾ dom 𝐹)))
9		undif 4438	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ⊆ dom 𝐹 ↔ (𝐴 ∪ (dom 𝐹 ∖ 𝐴)) = dom 𝐹)
10	9	biimpi 219	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ⊆ dom 𝐹 → (𝐴 ∪ (dom 𝐹 ∖ 𝐴)) = dom 𝐹)
11	10	eqcomd 2766	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ⊆ dom 𝐹 → dom 𝐹 = (𝐴 ∪ (dom 𝐹 ∖ 𝐴)))
12	11	reseq2d 5972	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ⊆ dom 𝐹 → (𝐹 ↾ dom 𝐹) = (𝐹 ↾ (𝐴 ∪ (dom 𝐹 ∖ 𝐴))))
13		resundi 5986	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 ↾ (𝐴 ∪ (dom 𝐹 ∖ 𝐴))) = ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))
14	12, 13	eqtrdi 2811	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ⊆ dom 𝐹 → (𝐹 ↾ dom 𝐹) = ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
15	14	rneqd 5922	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ⊆ dom 𝐹 → ran (𝐹 ↾ dom 𝐹) = ran ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
16		rnun 6136	. . . . . . . . . . . . . . 15 ⊢ ran ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) = (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))
17	15, 16	eqtrdi 2811	. . . . . . . . . . . . . 14 ⊢ (𝐴 ⊆ dom 𝐹 → ran (𝐹 ↾ dom 𝐹) = (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
18	17	eleq2d 2846	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ 𝑦 ∈ (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
19		elun 4100	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
20	18, 19	bitrdi 290	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
21	20	adantl 487	. . . . . . . . . . 11 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
22	8, 21	bitrd 282	. . . . . . . . . 10 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
23	22	adantl 487	. . . . . . . . 9 ⊢ (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) ∧ (Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) → (𝑦 ∈ ran 𝐹 ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
24		pm2.27 43	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
25	24	jao1i 872	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) → ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
26	25	com12 33	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → ((𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
27	26	adantr 486	. . . . . . . . 9 ⊢ (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) ∧ (Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) → ((𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
28	23, 27	sylbid 243	. . . . . . . 8 ⊢ (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) ∧ (Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
29	28	ex 418	. . . . . . 7 ⊢ ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴))))
30	3, 29	syl 18	. . . . . 6 ⊢ (ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴))))
31	30	impcom 413	. . . . 5 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
32	31	ssrdv 3937	. . . 4 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → ran 𝐹 ⊆ ran (𝐹 ↾ 𝐴))
33		rnresss 6010	. . . . 5 ⊢ ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹
34	33	a1i 11	. . . 4 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹)
35	32, 34	eqssd 3948	. . 3 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → ran 𝐹 = ran (𝐹 ↾ 𝐴))
36	35	ex 418	. 2 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ran 𝐹 = ran (𝐹 ↾ 𝐴)))
37	2, 36	biimtrid 245	1 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ((𝐹 “ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ran 𝐹 = ran (𝐹 ↾ 𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ∖ cdif 3896   ∪ cun 3897   ⊆ wss 3899  dom cdm 5655  ran crn 5656   ↾ cres 5657   “ cima 5658  Rel wrel 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668

This theorem is used by: (None)