| 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 6115 | . 2 ⊢ Rel ◡𝑅 | |
| 2 | relxp 5673 | . . . 4 ⊢ Rel ({𝑥} × (◡𝑅 “ {𝑥})) | |
| 3 | 2 | rgenw 3085 | . . 3 ⊢ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥})) |
| 4 | reliun 5800 | . . 3 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥}))) | |
| 5 | 3, 4 | mpbir 234 | . 2 ⊢ Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) |
| 6 | vex 3455 | . . . . . . . . 9 ⊢ 𝑧 ∈ V | |
| 7 | vex 3455 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
| 8 | 6, 7 | opeldm 5898 | . . . . . . . 8 ⊢ (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ dom ◡𝑅) |
| 9 | df-rn 5666 | . . . . . . . 8 ⊢ ran 𝑅 = dom ◡𝑅 | |
| 10 | 8, 9 | eleqtrrdi 2876 | . . . . . . 7 ⊢ (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ ran 𝑅) |
| 11 | ssel2 3905 | . . . . . . 7 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 𝑧 ∈ ran 𝑅) → 𝑧 ∈ 𝐴) | |
| 12 | 10, 11 | sylan2 605 | . . . . . 6 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅) → 𝑧 ∈ 𝐴) |
| 13 | 12 | ex 418 | . . . . 5 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ 𝐴)) |
| 14 | 13 | pm4.71rd 572 | . . . 4 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅))) |
| 15 | 6, 7 | elimasn 6103 | . . . . 5 ⊢ (𝑦 ∈ (◡𝑅 “ {𝑧}) ↔ 〈𝑧, 𝑦〉 ∈ ◡𝑅) |
| 16 | 15 | anbi2i 635 | . . . 4 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})) ↔ (𝑧 ∈ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅)) |
| 17 | 14, 16 | bitr4di 292 | . . 3 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})))) |
| 18 | sneq 4591 | . . . . 5 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧}) | |
| 19 | 18 | imaeq2d 6067 | . . . 4 ⊢ (𝑥 = 𝑧 → (◡𝑅 “ {𝑥}) = (◡𝑅 “ {𝑧})) |
| 20 | 19 | opeliunxp2 5822 | . . 3 ⊢ (〈𝑧, 𝑦〉 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧}))) |
| 21 | 17, 20 | bitr4di 292 | . 2 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ 〈𝑧, 𝑦〉 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})))) |
| 22 | 1, 5, 21 | eqrelrdv 5774 | 1 ⊢ (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2148 ∀wral 3081 ⊆ wss 3897 {csn 4585 〈cop 4837 ∪ ciun 4953 × cxp 5653 ◡ccnv 5654 dom cdm 5655 ran crn 5656 “ cima 5658 Rel wrel 5660 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2150 ax-9 2158 ax-10 2181 ax-11 2198 ax-12 2217 ax-ext 2736 ax-sep 5252 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2743 df-cleq 2756 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3849 df-ss 3898 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4483 df-sn 4586 df-pr 4588 df-op 4838 df-iun 4955 df-br 5106 df-opab 5171 df-xp 5661 df-rel 5662 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 |
| This theorem is used by: gsummpt2co 33704 |
| Copyright terms: Public domain | W3C validator |