| 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 5871 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| relbrcnvg | ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 6117 | . . . 4 ⊢ Rel ◡𝑅 | |
| 2 | 1 | brrelex12i 5712 | . . 3 ⊢ (𝐴◡𝑅𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 3 | 2 | a1i 11 | . 2 ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 4 | brrelex12 5709 | . . . 4 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
| 5 | 4 | ancomd 467 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 6 | 5 | ex 418 | . 2 ⊢ (Rel 𝑅 → (𝐵𝑅𝐴 → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 7 | brcnvg 5868 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) | |
| 8 | 7 | a1i 11 | . 2 ⊢ (Rel 𝑅 → ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴))) |
| 9 | 3, 6, 8 | pm5.21ndd 382 | 1 ⊢ (Rel 𝑅 → (𝐴◡𝑅𝐵 ↔ 𝐵𝑅𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2150 Vcvv 3453 class class class wbr 5107 ◡ccnv 5656 Rel wrel 5662 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-xp 5663 df-rel 5664 df-cnv 5665 |
| This theorem is used by: eliniseg2 6119 relbrcnv 6120 isinv 17987 releleccnv 39460 relcnveq2 39529 elrelscnveq2 39829 eqvrelsym 39889 brco2f1o 45353 brco3f1o 45354 ntrclsnvobr 45373 neicvgel1 45440 |
| Copyright terms: Public domain | W3C validator |