| 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 5834 | . . . . 5 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵)) | |
| 2 | 1 | ancoms 458 | . . . 4 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺) → (𝐵◡𝐶𝐴 ↔ 𝐴𝐶𝐵)) |
| 3 | 2 | biimp3ar 1473 | . . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵◡𝐶𝐴) |
| 4 | breldmg 5864 | . . . 4 ⊢ ((𝐵 ∈ 𝐺 ∧ 𝐴 ∈ 𝐹 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶) | |
| 5 | 4 | 3com12 1124 | . . 3 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐵◡𝐶𝐴) → 𝐵 ∈ dom ◡𝐶) |
| 6 | 3, 5 | syld3an3 1412 | . 2 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ dom ◡𝐶) |
| 7 | df-rn 5642 | . 2 ⊢ ran 𝐶 = dom ◡𝐶 | |
| 8 | 6, 7 | eleqtrrdi 2847 | 1 ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐺 ∧ 𝐴𝐶𝐵) → 𝐵 ∈ ran 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 ∈ wcel 2114 class class class wbr 5085 ◡ccnv 5630 dom cdm 5631 ran crn 5632 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-cnv 5639 df-dm 5641 df-rn 5642 |
| This theorem is referenced by: brelrn 5897 relelrn 5900 sossfld 6150 fvrn0 6868 pgpfaclem1 20058 perpln2 28779 ralmo 38681 |
| Copyright terms: Public domain | W3C validator |