| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brrelex12 | Structured version Visualization version GIF version | ||
| Description: Two classes related by a binary relation are sets. (Contributed by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| brrelex12 | ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rel 5664 | . . . . 5 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
| 2 | 1 | biimpi 219 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V)) |
| 3 | 2 | ssbrd 5153 | . . 3 ⊢ (Rel 𝑅 → (𝐴𝑅𝐵 → 𝐴(V × V)𝐵)) |
| 4 | 3 | imp 412 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴(V × V)𝐵) |
| 5 | brxp 5706 | . 2 ⊢ (𝐴(V × V)𝐵 ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
| 6 | 4, 5 | sylib 221 | 1 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2150 Vcvv 3453 ⊆ wss 3899 class class class wbr 5107 × cxp 5655 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: brrelex1 5710 brrelex2 5711 brrelex12i 5712 relbrcnvg 6118 brovex 8276 ersym 8767 relelec 8802 fpwwe2lem2 10755 fpwwelem 10768 cofuval2 18114 isnat 18177 pslem 18798 frgpuplem 20039 perpln1 29244 perpln2 29245 poprelb 48939 precofval3 50927 |
| Copyright terms: Public domain | W3C validator |