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

Theorem ssrelrn 5829
Description: If a relation is a subset of a cartesian product, then for each element of the range of the relation there is an element of the first set of the cartesian product which is related to the element of the range by the relation. (Contributed by AV, 24-Oct-2020.)
Assertion
Ref Expression
ssrelrn ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎𝐴 𝑎𝑅𝑌)
Distinct variable groups:   𝐴,𝑎   𝐵,𝑎   𝑅,𝑎   𝑌,𝑎

Proof of Theorem ssrelrn
StepHypRef Expression
1 elrng 5826 . . . . 5 (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 ↔ ∃𝑎 𝑎𝑅𝑌))
2 ssbr 5130 . . . . . . . . . . 11 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌𝑎(𝐴 × 𝐵)𝑌))
3 brxp 5660 . . . . . . . . . . . 12 (𝑎(𝐴 × 𝐵)𝑌 ↔ (𝑎𝐴𝑌𝐵))
43simplbi 497 . . . . . . . . . . 11 (𝑎(𝐴 × 𝐵)𝑌𝑎𝐴)
52, 4syl6 35 . . . . . . . . . 10 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌𝑎𝐴))
65ancrd 551 . . . . . . . . 9 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → (𝑎𝐴𝑎𝑅𝑌)))
76adantl 481 . . . . . . . 8 ((𝑌 ∈ ran 𝑅𝑅 ⊆ (𝐴 × 𝐵)) → (𝑎𝑅𝑌 → (𝑎𝐴𝑎𝑅𝑌)))
87eximdv 1918 . . . . . . 7 ((𝑌 ∈ ran 𝑅𝑅 ⊆ (𝐴 × 𝐵)) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎𝐴𝑎𝑅𝑌)))
98ex 412 . . . . . 6 (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎𝐴𝑎𝑅𝑌))))
109com23 86 . . . . 5 (𝑌 ∈ ran 𝑅 → (∃𝑎 𝑎𝑅𝑌 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎𝐴𝑎𝑅𝑌))))
111, 10sylbid 240 . . . 4 (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎𝐴𝑎𝑅𝑌))))
1211pm2.43i 52 . . 3 (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎𝐴𝑎𝑅𝑌)))
1312impcom 407 . 2 ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎(𝑎𝐴𝑎𝑅𝑌))
14 df-rex 3057 . 2 (∃𝑎𝐴 𝑎𝑅𝑌 ↔ ∃𝑎(𝑎𝐴𝑎𝑅𝑌))
1513, 14sylibr 234 1 ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎𝐴 𝑎𝑅𝑌)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wex 1780  wcel 2111  wrex 3056  wss 3897   class class class wbr 5086   × cxp 5609  ran crn 5612
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-br 5087  df-opab 5149  df-xp 5617  df-cnv 5619  df-dm 5621  df-rn 5622
This theorem is referenced by:  incistruhgr  29052
  Copyright terms: Public domain W3C validator