MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  imadifssranOLD Structured version   Visualization version   GIF version

Theorem imadifssranOLD 6205
Description: Obsolete version of imadifssran 6204 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.
StepHypRef Expression
1 df-ima 5676 . . 3 (𝐹 “ (dom 𝐹𝐴)) = ran (𝐹 ↾ (dom 𝐹𝐴))
21sseq1i 3966 . 2 ((𝐹 “ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴) ↔ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴))
3 ssel 3932 . . . . . . 7 (ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴) → (𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)))
4 resdm 6027 . . . . . . . . . . . . . . 15 (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
54eqcomd 2771 . . . . . . . . . . . . . 14 (Rel 𝐹𝐹 = (𝐹 ↾ dom 𝐹))
65adantr 486 . . . . . . . . . . . . 13 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → 𝐹 = (𝐹 ↾ dom 𝐹))
76rneqd 5930 . . . . . . . . . . . 12 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → ran 𝐹 = ran (𝐹 ↾ dom 𝐹))
87eleq2d 2851 . . . . . . . . . . 11 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹𝑦 ∈ ran (𝐹 ↾ dom 𝐹)))
9 undif 4445 . . . . . . . . . . . . . . . . . . . 20 (𝐴 ⊆ dom 𝐹 ↔ (𝐴 ∪ (dom 𝐹𝐴)) = dom 𝐹)
109biimpi 219 . . . . . . . . . . . . . . . . . . 19 (𝐴 ⊆ dom 𝐹 → (𝐴 ∪ (dom 𝐹𝐴)) = dom 𝐹)
1110eqcomd 2771 . . . . . . . . . . . . . . . . . 18 (𝐴 ⊆ dom 𝐹 → dom 𝐹 = (𝐴 ∪ (dom 𝐹𝐴)))
1211reseq2d 5980 . . . . . . . . . . . . . . . . 17 (𝐴 ⊆ dom 𝐹 → (𝐹 ↾ dom 𝐹) = (𝐹 ↾ (𝐴 ∪ (dom 𝐹𝐴))))
13 resundi 5994 . . . . . . . . . . . . . . . . 17 (𝐹 ↾ (𝐴 ∪ (dom 𝐹𝐴))) = ((𝐹𝐴) ∪ (𝐹 ↾ (dom 𝐹𝐴)))
1412, 13eqtrdi 2816 . . . . . . . . . . . . . . . 16 (𝐴 ⊆ dom 𝐹 → (𝐹 ↾ dom 𝐹) = ((𝐹𝐴) ∪ (𝐹 ↾ (dom 𝐹𝐴))))
1514rneqd 5930 . . . . . . . . . . . . . . 15 (𝐴 ⊆ dom 𝐹 → ran (𝐹 ↾ dom 𝐹) = ran ((𝐹𝐴) ∪ (𝐹 ↾ (dom 𝐹𝐴))))
16 rnun 6144 . . . . . . . . . . . . . . 15 ran ((𝐹𝐴) ∪ (𝐹 ↾ (dom 𝐹𝐴))) = (ran (𝐹𝐴) ∪ ran (𝐹 ↾ (dom 𝐹𝐴)))
1715, 16eqtrdi 2816 . . . . . . . . . . . . . 14 (𝐴 ⊆ dom 𝐹 → ran (𝐹 ↾ dom 𝐹) = (ran (𝐹𝐴) ∪ ran (𝐹 ↾ (dom 𝐹𝐴))))
1817eleq2d 2851 . . . . . . . . . . . . 13 (𝐴 ⊆ dom 𝐹 → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ 𝑦 ∈ (ran (𝐹𝐴) ∪ ran (𝐹 ↾ (dom 𝐹𝐴)))))
19 elun 4107 . . . . . . . . . . . . 13 (𝑦 ∈ (ran (𝐹𝐴) ∪ ran (𝐹 ↾ (dom 𝐹𝐴))) ↔ (𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴))))
2018, 19bitrdi 290 . . . . . . . . . . . 12 (𝐴 ⊆ dom 𝐹 → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ (𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)))))
2120adantl 487 . . . . . . . . . . 11 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran (𝐹 ↾ dom 𝐹) ↔ (𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)))))
228, 21bitrd 282 . . . . . . . . . 10 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹 ↔ (𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)))))
2322adantl 487 . . . . . . . . 9 (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) ∧ (Rel 𝐹𝐴 ⊆ dom 𝐹)) → (𝑦 ∈ ran 𝐹 ↔ (𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)))))
24 pm2.27 43 . . . . . . . . . . . 12 (𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)))
2524jao1i 872 . . . . . . . . . . 11 ((𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴))) → ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)))
2625com12 33 . . . . . . . . . 10 ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) → ((𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴))) → 𝑦 ∈ ran (𝐹𝐴)))
2726adantr 486 . . . . . . . . 9 (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) ∧ (Rel 𝐹𝐴 ⊆ dom 𝐹)) → ((𝑦 ∈ ran (𝐹𝐴) ∨ 𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴))) → 𝑦 ∈ ran (𝐹𝐴)))
2823, 27sylbid 243 . . . . . . . 8 (((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) ∧ (Rel 𝐹𝐴 ⊆ dom 𝐹)) → (𝑦 ∈ ran 𝐹𝑦 ∈ ran (𝐹𝐴)))
2928ex 418 . . . . . . 7 ((𝑦 ∈ ran (𝐹 ↾ (dom 𝐹𝐴)) → 𝑦 ∈ ran (𝐹𝐴)) → ((Rel 𝐹𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹𝑦 ∈ ran (𝐹𝐴))))
303, 29syl 18 . . . . . 6 (ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴) → ((Rel 𝐹𝐴 ⊆ dom 𝐹) → (𝑦 ∈ ran 𝐹𝑦 ∈ ran (𝐹𝐴))))
3130impcom 413 . . . . 5 (((Rel 𝐹𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴)) → (𝑦 ∈ ran 𝐹𝑦 ∈ ran (𝐹𝐴)))
3231ssrdv 3944 . . . 4 (((Rel 𝐹𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴)) → ran 𝐹 ⊆ ran (𝐹𝐴))
33 rnresss 6018 . . . . 5 ran (𝐹𝐴) ⊆ ran 𝐹
3433a1i 11 . . . 4 (((Rel 𝐹𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴)) → ran (𝐹𝐴) ⊆ ran 𝐹)
3532, 34eqssd 3955 . . 3 (((Rel 𝐹𝐴 ⊆ dom 𝐹) ∧ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴)) → ran 𝐹 = ran (𝐹𝐴))
3635ex 418 . 2 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → (ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴) → ran 𝐹 = ran (𝐹𝐴)))
372, 36biimtrid 245 1 ((Rel 𝐹𝐴 ⊆ dom 𝐹) → ((𝐹 “ (dom 𝐹𝐴)) ⊆ ran (𝐹𝐴) → ran 𝐹 = ran (𝐹𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wo 861   = wceq 1570  wcel 2146  cdif 3903  cun 3904  wss 3906  dom cdm 5663  ran crn 5664  cres 5665  cima 5666  Rel wrel 5668
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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406
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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator