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

Theorem ssrelrn 5876
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 5873 . . . . 5 (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 ↔ ∃𝑎 𝑎𝑅𝑌))
2 ssbr 5149 . . . . . . . . . . 11 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → 𝑎(𝐴 × 𝐵)𝑌))
3 brxp 5700 . . . . . . . . . . . 12 (𝑎(𝐴 × 𝐵)𝑌 ↔ (𝑎 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵))
43simplbi 502 . . . . . . . . . . 11 (𝑎(𝐴 × 𝐵)𝑌 → 𝑎 ∈ 𝐴)
52, 4syl6 36 . . . . . . . . . 10 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → 𝑎 ∈ 𝐴))
65ancrd 561 . . . . . . . . 9 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → (𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))
76adantl 487 . . . . . . . 8 ((𝑌 ∈ ran 𝑅 ∧ 𝑅 ⊆ (𝐴 × 𝐵)) → (𝑎𝑅𝑌 → (𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))
87eximdv 1950 . . . . . . 7 ((𝑌 ∈ ran 𝑅 ∧ 𝑅 ⊆ (𝐴 × 𝐵)) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))
98ex 418 . . . . . 6 (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))))
109com23 87 . . . . 5 (𝑌 ∈ ran 𝑅 → (∃𝑎 𝑎𝑅𝑌 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))))
111, 10sylbid 243 . . . 4 (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))))
1211pm2.43i 53 . . 3 (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))
1312impcom 413 . 2 ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))
14 df-rex 3088 . 2 (∃𝑎 ∈ 𝐴 𝑎𝑅𝑌 ↔ ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))
1513, 14sylibr 237 1 ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎 ∈ 𝐴 𝑎𝑅𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087   ⊆ wss 3899   class class class wbr 5103   × cxp 5649  ran crn 5652
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
This theorem is used by:  incistruhgr  29650
  Copyright terms: Public domain W3C validator