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 5562 | . . . . 5 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
2 | 1 | biimpi 218 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V)) |
3 | 2 | ssbrd 5109 | . . 3 ⊢ (Rel 𝑅 → (𝐴𝑅𝐵 → 𝐴(V × V)𝐵)) |
4 | 3 | imp 409 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴(V × V)𝐵) |
5 | brxp 5601 | . 2 ⊢ (𝐴(V × V)𝐵 ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V)) | |
6 | 4, 5 | sylib 220 | 1 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2114 Vcvv 3494 ⊆ wss 3936 class class class wbr 5066 × cxp 5553 Rel wrel 5560 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 |
This theorem is referenced by: brrelex1 5605 brrelex2 5606 brrelex12i 5607 relbrcnvg 5968 brovex 7888 ersym 8301 relelec 8334 fpwwe2lem2 10054 fpwwelem 10067 cofuval2 17157 isnat 17217 pslem 17816 frgpuplem 18898 perpln1 26496 perpln2 26497 poprelb 43706 |
Copyright terms: Public domain | W3C validator |