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

Theorem imassrnOLD 6069
Description: Obsolete version of imassrn 6196 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 4014 . 2 {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)} ⊆ {𝑦 ∣ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐴}
3 dfima3 6059 . 2 (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)}
4 dfrn3 5871 . 2 ran 𝐴 = {𝑦 ∣ ∃𝑥⟨𝑥, 𝑦⟩ ∈ 𝐴}
52, 3, 43sstr4i 3982 1 (𝐴 “ 𝐵) ⊆ ran 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1812   ∈ wcel 2145  {cab 2739   ⊆ wss 3899  ⟨cop 4590  ran crn 5652   “ cima 5654
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 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator