| 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 5863 | . . . . 5 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵)) | |
| 2 | 1 | ancoms 463 | . . . 4 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵)) |
| 3 | 2 | biimp3ar 1496 | . . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵◡𝐶𝐴) |
| 4 | breldmg 5897 | . . . 4 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶) | |
| 5 | 4 | 3com12 1139 | . . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶) |
| 6 | 3, 5 | syld3an3 1434 | . 2 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ dom ◡𝐶) |
| 7 | df-rn 5670 | . 2 ⊢ ran 𝐶 = dom ◡𝐶 | |
| 8 | 6, 7 | eleqtrrdi 2880 | 1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1101 ∈ wcel 2149 class class class wbr 5110 ◡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 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5258 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5175 df-cnv 5667 df-dm 5669 df-rn 5670 |
| This theorem is referenced by: brelrn 5930 relelrn 5933 sossfld 6183 fvrn0 6907 pgpfaclem1 20149 perpln2 28946 ralmo 38894 |
| Copyright terms: Public domain | W3C validator |