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

Theorem dminss 6150
Description: An upper bound for intersection with a domain. Theorem 40 of [Suppes] p. 66, who calls it "somewhat surprising". (Contributed by NM, 11-Aug-2004.)
Assertion
Ref Expression
dminss (dom 𝑅𝐴) ⊆ (𝑅 “ (𝑅𝐴))

Proof of Theorem dminss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.8a 2217 . . . . . . 7 ((𝑥𝐴𝑥𝑅𝑦) → ∃𝑥(𝑥𝐴𝑥𝑅𝑦))
21ancoms 463 . . . . . 6 ((𝑥𝑅𝑦𝑥𝐴) → ∃𝑥(𝑥𝐴𝑥𝑅𝑦))
3 vex 3459 . . . . . . 7 𝑦 ∈ V
43elima2 6068 . . . . . 6 (𝑦 ∈ (𝑅𝐴) ↔ ∃𝑥(𝑥𝐴𝑥𝑅𝑦))
52, 4sylibr 237 . . . . 5 ((𝑥𝑅𝑦𝑥𝐴) → 𝑦 ∈ (𝑅𝐴))
6 vex 3459 . . . . . . 7 𝑥 ∈ V
73, 6brcnv 5868 . . . . . 6 (𝑦𝑅𝑥𝑥𝑅𝑦)
87biranri 510 . . . . 5 ((𝑥𝑅𝑦𝑥𝐴) → 𝑦𝑅𝑥)
95, 8jca 520 . . . 4 ((𝑥𝑅𝑦𝑥𝐴) → (𝑦 ∈ (𝑅𝐴) ∧ 𝑦𝑅𝑥))
109eximi 1865 . . 3 (∃𝑦(𝑥𝑅𝑦𝑥𝐴) → ∃𝑦(𝑦 ∈ (𝑅𝐴) ∧ 𝑦𝑅𝑥))
116eldm 5890 . . . . 5 (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦)
1211anbi1i 635 . . . 4 ((𝑥 ∈ dom 𝑅𝑥𝐴) ↔ (∃𝑦 𝑥𝑅𝑦𝑥𝐴))
13 elin 3921 . . . 4 (𝑥 ∈ (dom 𝑅𝐴) ↔ (𝑥 ∈ dom 𝑅𝑥𝐴))
14 19.41v 1979 . . . 4 (∃𝑦(𝑥𝑅𝑦𝑥𝐴) ↔ (∃𝑦 𝑥𝑅𝑦𝑥𝐴))
1512, 13, 143bitr4i 306 . . 3 (𝑥 ∈ (dom 𝑅𝐴) ↔ ∃𝑦(𝑥𝑅𝑦𝑥𝐴))
166elima2 6068 . . 3 (𝑥 ∈ (𝑅 “ (𝑅𝐴)) ↔ ∃𝑦(𝑦 ∈ (𝑅𝐴) ∧ 𝑦𝑅𝑥))
1710, 15, 163imtr4i 295 . 2 (𝑥 ∈ (dom 𝑅𝐴) → 𝑥 ∈ (𝑅 “ (𝑅𝐴)))
1817ssriv 3941 1 (dom 𝑅𝐴) ⊆ (𝑅 “ (𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  wa 400  wex 1809  wcel 2143  cin 3904  wss 3905   class class class wbr 5109  ccnv 5660  dom cdm 5661  cima 5664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674
This theorem is referenced by:  lmhmlsp  21170  cnclsi  23429  kgencn3  23715  kqsat  23888  kqcldsat  23890  cfilucfil  24716  elrgspnsubrunlem2  33568  elrspunidl  33736
  Copyright terms: Public domain W3C validator