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 5614 | . . . . 5 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
2 | 1 | biimpi 215 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V)) |
3 | 2 | ssbrd 5129 | . . 3 ⊢ (Rel 𝑅 → (𝐴𝑅𝐵 → 𝐴(V × V)𝐵)) |
4 | 3 | imp 407 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴(V × V)𝐵) |
5 | brxp 5654 | . 2 ⊢ (𝐴(V × V)𝐵 ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
6 | 4, 5 | sylib 217 | 1 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2105 Vcvv 3440 ⊆ wss 3896 class class class wbr 5086 × cxp 5605 Rel wrel 5612 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2707 ax-sep 5237 ax-nul 5244 ax-pr 5366 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-ral 3062 df-rex 3071 df-rab 3404 df-v 3442 df-dif 3899 df-un 3901 df-in 3903 df-ss 3913 df-nul 4267 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5087 df-opab 5149 df-xp 5613 df-rel 5614 |
This theorem is referenced by: brrelex1 5658 brrelex2 5659 brrelex12i 5660 relbrcnvg 6030 brovex 8086 ersym 8559 relelec 8592 fpwwe2lem2 10467 fpwwelem 10480 cofuval2 17676 isnat 17737 pslem 18364 frgpuplem 19450 perpln1 27204 perpln2 27205 poprelb 45246 |
Copyright terms: Public domain | W3C validator |