| 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 5863 | . . . . 5 ⊢ (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 ↔ ∃𝑎 𝑎𝑅𝑌)) | |
| 2 | ssbr 5141 | . . . . . . . . . . 11 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → 𝑎(𝐴 × 𝐵)𝑌)) | |
| 3 | brxp 5692 | . . . . . . . . . . . 12 ⊢ (𝑎(𝐴 × 𝐵)𝑌 ↔ (𝑎 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) | |
| 4 | 3 | simplbi 500 | . . . . . . . . . . 11 ⊢ (𝑎(𝐴 × 𝐵)𝑌 → 𝑎 ∈ 𝐴) |
| 5 | 2, 4 | syl6 35 | . . . . . . . . . 10 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → 𝑎 ∈ 𝐴)) |
| 6 | 5 | ancrd 559 | . . . . . . . . 9 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑎𝑅𝑌 → (𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 7 | 6 | adantl 485 | . . . . . . . 8 ⊢ ((𝑌 ∈ ran 𝑅 ∧ 𝑅 ⊆ (𝐴 × 𝐵)) → (𝑎𝑅𝑌 → (𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 8 | 7 | eximdv 1936 | . . . . . . 7 ⊢ ((𝑌 ∈ ran 𝑅 ∧ 𝑅 ⊆ (𝐴 × 𝐵)) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 9 | 8 | ex 416 | . . . . . 6 ⊢ (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → (∃𝑎 𝑎𝑅𝑌 → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))) |
| 10 | 9 | com23 86 | . . . . 5 ⊢ (𝑌 ∈ ran 𝑅 → (∃𝑎 𝑎𝑅𝑌 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))) |
| 11 | 1, 10 | sylbid 242 | . . . 4 ⊢ (𝑌 ∈ ran 𝑅 → (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)))) |
| 12 | 11 | pm2.43i 52 | . . 3 ⊢ (𝑌 ∈ ran 𝑅 → (𝑅 ⊆ (𝐴 × 𝐵) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌))) |
| 13 | 12 | impcom 411 | . 2 ⊢ ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)) |
| 14 | df-rex 3086 | . 2 ⊢ (∃𝑎 ∈ 𝐴 𝑎𝑅𝑌 ↔ ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑎𝑅𝑌)) | |
| 15 | 13, 14 | sylibr 236 | 1 ⊢ ((𝑅 ⊆ (𝐴 × 𝐵) ∧ 𝑌 ∈ ran 𝑅) → ∃𝑎 ∈ 𝐴 𝑎𝑅𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∃wex 1798 ∈ wcel 2141 ∃wrex 3085 ⊆ wss 3902 class class class wbr 5097 × cxp 5641 ran crn 5644 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-opab 5160 df-xp 5649 df-cnv 5651 df-dm 5653 df-rn 5654 |
| This theorem is referenced by: incistruhgr 29237 |
| Copyright terms: Public domain | W3C validator |