Theorem imadifssran 6124

Description: Condition for the range of a relation to be the range of one its restrictions. (Contributed by AV, 4-Oct-2025.)

Assertion

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

Proof of Theorem imadifssran

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ima 5651	. . 3 ⊢ (𝐹 “ (dom 𝐹 ∖ 𝐴)) = ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))
2	1	sseq1i 3975	. 2 ⊢ ((𝐹 “ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) ↔ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴))
3		ssel 3940	. . . . . . 7 ⊢ (ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → (𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
4		resdm 5997	. . . . . . . . . . . . . . 15 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
5	4	eqcomd 2735	. . . . . . . . . . . . . 14 ⊢ (Rel 𝐹 → 𝐹 = (𝐹 ↾ dom 𝐹))
6	5	adantr 480	. . . . . . . . . . . . 13 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → 𝐹 = (𝐹 ↾ dom 𝐹))
7	6	rneqd 5902	. . . . . . . . . . . 12 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ran 𝐹 = ran (𝐹 ↾ dom 𝐹))
8	7	eleq2d 2814	. . . . . . . . . . 11 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 ↔ 𝑦 ∈ ran (𝐹 ↾ dom 𝐹)))
9		undif 4445	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ⊆ dom 𝐹 ↔ (𝐴 ∪ (dom 𝐹 ∖ 𝐴)) = dom 𝐹)
10	9	biimpi 216	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ⊆ dom 𝐹 → (𝐴 ∪ (dom 𝐹 ∖ 𝐴)) = dom 𝐹)
11	10	eqcomd 2735	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ⊆ dom 𝐹 → dom 𝐹 = (𝐴 ∪ (dom 𝐹 ∖ 𝐴)))
12	11	reseq2d 5950	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ⊆ dom 𝐹 → (𝐹 ↾ dom 𝐹) = (𝐹 ↾ (𝐴 ∪ (dom 𝐹 ∖ 𝐴))))
13		resundi 5964	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 ↾ (𝐴 ∪ (dom 𝐹 ∖ 𝐴))) = ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))
14	12, 13	eqtrdi 2780	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ⊆ dom 𝐹 → (𝐹 ↾ dom 𝐹) = ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
15	14	rneqd 5902	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ⊆ dom 𝐹 → ran (𝐹 ↾ dom 𝐹) = ran ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
16		rnun 6118	. . . . . . . . . . . . . . 15 ⊢ ran ((𝐹 ↾ 𝐴) ∪ (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) = (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))
17	15, 16	eqtrdi 2780	. . . . . . . . . . . . . 14 ⊢ (𝐴 ⊆ dom 𝐹 → ran (𝐹 ↾ dom 𝐹) = (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
18	17	eleq2d 2814	. . . . . . . . . . . . 13 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ 𝑦 ∈ (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
19		elun 4116	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (ran (𝐹 ↾ 𝐴) ∪ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))))
20	18, 19	bitrdi 287	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ dom 𝐹 → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
21	20	adantl 481	. . . . . . . . . . 11 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
22	8, 21	bitrd 279	. . . . . . . . . 10 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
23	22	adantl 481	. . . . . . . . 9 ⊢ (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) ∧ (Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) → (𝑦 ∈ ran 𝐹 ↔ (𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)))))
24		pm2.27 42	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
25	24	jao1i 858	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) → ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
26	25	com12 32	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → ((𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
27	26	adantr 480	. . . . . . . . 9 ⊢ (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) ∧ (Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) → ((𝑦 ∈ ran (𝐹 ↾ 𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴))) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
28	23, 27	sylbid 240	. . . . . . . 8 ⊢ (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) ∧ (Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
29	28	ex 412	. . . . . . 7 ⊢ ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) → 𝑦 ∈ ran (𝐹 ↾ 𝐴)) → ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴))))
30	3, 29	syl 17	. . . . . 6 ⊢ (ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴))))
31	30	impcom 407	. . . . 5 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → (𝑦 ∈ ran 𝐹 → 𝑦 ∈ ran (𝐹 ↾ 𝐴)))
32	31	ssrdv 3952	. . . 4 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → ran 𝐹 ⊆ ran (𝐹 ↾ 𝐴))
33		rnresss 5988	. . . . 5 ⊢ ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹
34	33	a1i 11	. . . 4 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → ran (𝐹 ↾ 𝐴) ⊆ ran 𝐹)
35	32, 34	eqssd 3964	. . 3 ⊢ (((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴)) → ran 𝐹 = ran (𝐹 ↾ 𝐴))
36	35	ex 412	. 2 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (ran (𝐹 ↾ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ran 𝐹 = ran (𝐹 ↾ 𝐴)))
37	2, 36	biimtrid 242	1 ⊢ ((Rel 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ((𝐹 “ (dom 𝐹 ∖ 𝐴)) ⊆ ran (𝐹 ↾ 𝐴) → ran 𝐹 = ran (𝐹 ↾ 𝐴)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109   ∖ cdif 3911   ∪ cun 3912   ⊆ wss 3914  dom cdm 5638  ran crn 5639   ↾ cres 5640   “ cima 5641  Rel wrel 5643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-xp 5644  df-rel 5645  df-cnv 5646  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651

This theorem is referenced by:  cyclnumvtx  29730