Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > brcnvssr | Structured version Visualization version GIF version |
Description: The converse of a subset relation swaps arguments. (Contributed by Peter Mazsa, 1-Aug-2019.) |
Ref | Expression |
---|---|
brcnvssr | ⊢ (𝐴 ∈ 𝑉 → (𝐴◡ S 𝐵 ↔ 𝐵 ⊆ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relssr 35620 | . . 3 ⊢ Rel S | |
2 | 1 | relbrcnv 5963 | . 2 ⊢ (𝐴◡ S 𝐵 ↔ 𝐵 S 𝐴) |
3 | brssr 35621 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐵 S 𝐴 ↔ 𝐵 ⊆ 𝐴)) | |
4 | 2, 3 | syl5bb 284 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴◡ S 𝐵 ↔ 𝐵 ⊆ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∈ wcel 2105 ⊆ wss 3933 class class class wbr 5057 ◡ccnv 5547 S cssr 35337 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-br 5058 df-opab 5120 df-xp 5554 df-rel 5555 df-cnv 5556 df-ssr 35618 |
This theorem is referenced by: brcnvssrid 35627 br1cossxrncnvssrres 35628 dfcnvrefrels2 35646 dfcnvrefrels3 35647 |
Copyright terms: Public domain | W3C validator |