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

Theorem imassrnOLD 6087
Description: Obsolete version of imassrn 6216 as of 27-Sep-2026. (Contributed by NM, 31-Mar-1995.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
imassrnOLD (𝐴 “ 𝐵) ⊆ ran 𝐴

Proof of Theorem imassrnOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 exsimpr 1902 . . 3 (∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴) → ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐴)
21ss2abi 3994 . 2 {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)} ⊆ {𝑦 ∣ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐴}
3 dfima3 6077 . 2 (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)}
4 dfrn3 5883 . 2 ran 𝐴 = {𝑦 ∣ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐴}
52, 3, 43sstr4i 3964 1 (𝐴 “ 𝐵) ⊆ ran 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1812   ∈ wcel 2147  {cab 2741   ⊆ wss 3900  ⟨cop 4840  ran crn 5659   “ cima 5661
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator