| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brrelex1 | Structured version Visualization version GIF version | ||
| Description: If two classes are related by a binary relation, then the first class is a set. (Contributed by NM, 18-May-2004.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| brrelex1 | ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brrelex12 5702 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
| 2 | 1 | simpld 500 | 1 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2144 Vcvv 3450 class class class wbr 5102 Rel wrel 5655 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 |
| This theorem is used by: brrelex1i 5706 posn 5736 frsn 5738 releldm 5925 relelrn 5926 relimasn 6082 funmo 6554 ertr 8733 fsuppss 9375 dirtr 18776 eqvreltr 39624 frege129d 44763 nnfoctb 46065 clim2d 46683 climfv 46701 meadjiun 47476 caragenunicl 47534 |
| Copyright terms: Public domain | W3C validator |