| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssrelrn | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| ssrelrn | ⊢ ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎 ∈ 𝐴 𝑎𝑅𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elrng 5855 | . . . . 5 ⊢ (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 ↔ ∃𝑎 𝑎𝑅𝑌)) | |
| 2 | ssbr 5151 | . . . . . . . . . . 11 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → 𝑎(𝐴 × 𝐵)𝑌)) | |
| 3 | brxp 5687 | . . . . . . . . . . . 12 ⊢ (𝑎(𝐴 × 𝐵)𝑌 ↔ (𝑎 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) | |
| 4 | 3 | simplbi 497 | . . . . . . . . . . 11 ⊢ (𝑎(𝐴 × 𝐵)𝑌 → 𝑎 ∈ 𝐴) |
| 5 | 2, 4 | syl6 35 | . . . . . . . . . 10 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → 𝑎 ∈ 𝐴)) |
| 6 | 5 | ancrd 551 | . . . . . . . . 9 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → (𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 7 | 6 | adantl 481 | . . . . . . . 8 ⊢ ((𝑌 ∈ ran 𝑅 ∧ 𝑅 ⊆ (𝐴 × 𝐵)) → (𝑎𝑅𝑌 → (𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 8 | 7 | eximdv 1917 | . . . . . . 7 ⊢ ((𝑌 ∈ ran 𝑅 ∧ 𝑅 ⊆ (𝐴 × 𝐵)) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 9 | 8 | ex 412 | . . . . . 6 ⊢ (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))) |
| 10 | 9 | com23 86 | . . . . 5 ⊢ (𝑌 ∈ ran 𝑅 → (∃𝑎 𝑎𝑅𝑌 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))) |
| 11 | 1, 10 | sylbid 240 | . . . 4 ⊢ (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))) |
| 12 | 11 | pm2.43i 52 | . . 3 ⊢ (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 13 | 12 | impcom 407 | . 2 ⊢ ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)) |
| 14 | df-rex 3054 | . 2 ⊢ (∃𝑎 ∈ 𝐴 𝑎𝑅𝑌 ↔ ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)) | |
| 15 | 13, 14 | sylibr 234 | 1 ⊢ ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎 ∈ 𝐴 𝑎𝑅𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1779 ∈ wcel 2109 ∃wrex 3053 ⊆ wss 3914 class class class wbr 5107 × cxp 5636 ran crn 5639 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-xp 5644 df-cnv 5646 df-dm 5648 df-rn 5649 |
| This theorem is referenced by: incistruhgr 29006 |
| Copyright terms: Public domain | W3C validator |