| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfcnv2 | Structured version Visualization version GIF version | ||
| Description: Alternative definition of the converse of a relation. (Contributed by Thierry Arnoux, 31-Mar-2018.) |
| Ref | Expression |
|---|---|
| dfcnv2 | ⊢ (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 6107 | . 2 ⊢ Rel ◡𝑅 | |
| 2 | relxp 5680 | . . . 4 ⊢ Rel ({𝑥} × (◡𝑅 “ {𝑥})) | |
| 3 | 2 | rgenw 3089 | . . 3 ⊢ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥})) |
| 4 | reliun 5804 | . . 3 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥}))) | |
| 5 | 3, 4 | mpbir 234 | . 2 ⊢ Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) |
| 6 | vex 3467 | . . . . . . . . 9 ⊢ 𝑧 ∈ V | |
| 7 | vex 3467 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
| 8 | 6, 7 | opeldm 5898 | . . . . . . . 8 ⊢ (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ dom ◡𝑅) |
| 9 | df-rn 5673 | . . . . . . . 8 ⊢ ran 𝑅 = dom ◡𝑅 | |
| 10 | 8, 9 | eleqtrrdi 2880 | . . . . . . 7 ⊢ (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ ran 𝑅) |
| 11 | ssel2 3940 | . . . . . . 7 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 𝑧 ∈ ran 𝑅) → 𝑧 ∈ 𝐴) | |
| 12 | 10, 11 | sylan2 604 | . . . . . 6 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅) → 𝑧 ∈ 𝐴) |
| 13 | 12 | ex 417 | . . . . 5 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ 𝐴)) |
| 14 | 13 | pm4.71rd 571 | . . . 4 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅))) |
| 15 | 6, 7 | elimasn 6093 | . . . . 5 ⊢ (𝑦 ∈ (◡𝑅 “ {𝑧}) ↔ 〈𝑧, 𝑦〉 ∈ ◡𝑅) |
| 16 | 15 | anbi2i 634 | . . . 4 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})) ↔ (𝑧 ∈ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅)) |
| 17 | 14, 16 | bitr4di 292 | . . 3 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})))) |
| 18 | sneq 4604 | . . . . 5 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧}) | |
| 19 | 18 | imaeq2d 6063 | . . . 4 ⊢ (𝑥 = 𝑧 → (◡𝑅 “ {𝑥}) = (◡𝑅 “ {𝑧})) |
| 20 | 19 | opeliunxp2 5825 | . . 3 ⊢ (〈𝑧, 𝑦〉 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧}))) |
| 21 | 17, 20 | bitr4di 292 | . 2 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ 〈𝑧, 𝑦〉 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})))) |
| 22 | 1, 5, 21 | eqrelrdv 5779 | 1 ⊢ (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ⊆ wss 3913 {csn 4594 〈cop 4600 ∪ ciun 4960 × cxp 5660 ◡ccnv 5661 dom cdm 5662 ran crn 5663 “ cima 5665 Rel wrel 5667 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-iun 4962 df-br 5114 df-opab 5178 df-xp 5668 df-rel 5669 df-cnv 5670 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 |
| This theorem is referenced by: gsummpt2co 33309 |
| Copyright terms: Public domain | W3C validator |