| 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 5709 | . 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 2150 Vcvv 3453 class class class wbr 5107 Rel wrel 5662 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-xp 5663 df-rel 5664 |
| This theorem is used by: brrelex1i 5713 posn 5744 frsn 5746 releldm 5937 relelrn 5938 relimasn 6100 funmo 6581 ertr 8770 fsuppss 9411 dirtr 18828 eqvreltr 39891 frege129d 45084 nnfoctb 46399 clim2d 47016 climfv 47034 meadjiun 47809 caragenunicl 47867 |
| Copyright terms: Public domain | W3C validator |