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 5564 | . . . . 5 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
2 | 1 | biimpi 218 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V)) |
3 | 2 | ssbrd 5111 | . . 3 ⊢ (Rel 𝑅 → (𝐴𝑅𝐵 → 𝐴(V × V)𝐵)) |
4 | 3 | imp 409 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴(V × V)𝐵) |
5 | brxp 5603 | . 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 3496 ⊆ wss 3938 class class class wbr 5068 × cxp 5555 Rel wrel 5562 |
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 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-xp 5563 df-rel 5564 |
This theorem is referenced by: brrelex1 5607 brrelex2 5608 brrelex12i 5609 relbrcnvg 5970 brovex 7890 ersym 8303 relelec 8336 fpwwe2lem2 10056 fpwwelem 10069 cofuval2 17159 isnat 17219 pslem 17818 frgpuplem 18900 perpln1 26498 perpln2 26499 poprelb 43693 |
Copyright terms: Public domain | W3C validator |