| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brelrng | Structured version Visualization version GIF version | ||
| Description: The second argument of a binary relation belongs to its range. (Contributed by NM, 29-Jun-2008.) |
| Ref | Expression |
|---|---|
| brelrng | ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brcnvg 5864 | . . . . 5 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵)) | |
| 2 | 1 | ancoms 458 | . . . 4 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵)) |
| 3 | 2 | biimp3ar 1472 | . . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵◡𝐶𝐴) |
| 4 | breldmg 5894 | . . . 4 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶) | |
| 5 | 4 | 3com12 1123 | . . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶) |
| 6 | 3, 5 | syld3an3 1411 | . 2 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ dom ◡𝐶) |
| 7 | df-rn 5670 | . 2 ⊢ ran 𝐶 = dom ◡𝐶 | |
| 8 | 6, 7 | eleqtrrdi 2846 | 1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 ∈ wcel 2109 class class class wbr 5124 ◡ccnv 5658 dom cdm 5659 ran crn 5660 |
| 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 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| 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 2715 df-cleq 2728 df-clel 2810 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-br 5125 df-opab 5187 df-cnv 5667 df-dm 5669 df-rn 5670 |
| This theorem is referenced by: brelrn 5927 relelrn 5930 sossfld 6180 fvrn0 6911 pgpfaclem1 20069 perpln2 28695 |
| Copyright terms: Public domain | W3C validator |