![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > relbrcnvg | Structured version Visualization version GIF version |
Description: When 𝑅 is a relation, the sethood assumptions on brcnv 5717 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.) |
Ref | Expression |
---|---|
relbrcnvg | ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relcnv 5934 | . . . 4 ⊢ Rel ◡𝑅 | |
2 | 1 | brrelex12i 5571 | . . 3 ⊢ (𝐴◡𝑅𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
3 | 2 | a1i 11 | . 2 ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
4 | brrelex12 5568 | . . . 4 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
5 | 4 | ancomd 465 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
6 | 5 | ex 416 | . 2 ⊢ (Rel 𝑅 → (𝐵𝑅𝐴 → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
7 | brcnvg 5714 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) | |
8 | 7 | a1i 11 | . 2 ⊢ (Rel 𝑅 → ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴))) |
9 | 3, 6, 8 | pm5.21ndd 384 | 1 ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2111 Vcvv 3441 class class class wbr 5030 ◡ccnv 5518 Rel wrel 5524 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 |
This theorem is referenced by: eliniseg2 5936 relbrcnv 5937 isinv 17022 releleccnv 35678 relcnveq2 35740 elrelscnveq2 35893 eqvrelsym 36000 brco2f1o 40735 brco3f1o 40736 ntrclsnvobr 40755 neicvgel1 40822 |
Copyright terms: Public domain | W3C validator |