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 6012 | . 2 ⊢ Rel ◡𝑅 | |
2 | relxp 5607 | . . . 4 ⊢ Rel ({𝑥} × (◡𝑅 “ {𝑥})) | |
3 | 2 | rgenw 3076 | . . 3 ⊢ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥})) |
4 | reliun 5726 | . . 3 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥}))) | |
5 | 3, 4 | mpbir 230 | . 2 ⊢ Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) |
6 | vex 3436 | . . . . . . . . 9 ⊢ 𝑧 ∈ V | |
7 | vex 3436 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
8 | 6, 7 | opeldm 5816 | . . . . . . . 8 ⊢ (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ dom ◡𝑅) |
9 | df-rn 5600 | . . . . . . . 8 ⊢ ran 𝑅 = dom ◡𝑅 | |
10 | 8, 9 | eleqtrrdi 2850 | . . . . . . 7 ⊢ (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ ran 𝑅) |
11 | ssel2 3916 | . . . . . . 7 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 𝑧 ∈ ran 𝑅) → 𝑧 ∈ 𝐴) | |
12 | 10, 11 | sylan2 593 | . . . . . 6 ⊢ ((ran 𝑅 ⊆ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅) → 𝑧 ∈ 𝐴) |
13 | 12 | ex 413 | . . . . 5 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 → 𝑧 ∈ 𝐴)) |
14 | 13 | pm4.71rd 563 | . . . 4 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅))) |
15 | 6, 7 | elimasn 5997 | . . . . 5 ⊢ (𝑦 ∈ (◡𝑅 “ {𝑧}) ↔ 〈𝑧, 𝑦〉 ∈ ◡𝑅) |
16 | 15 | anbi2i 623 | . . . 4 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})) ↔ (𝑧 ∈ 𝐴 ∧ 〈𝑧, 𝑦〉 ∈ ◡𝑅)) |
17 | 14, 16 | bitr4di 289 | . . 3 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})))) |
18 | sneq 4571 | . . . . 5 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧}) | |
19 | 18 | imaeq2d 5969 | . . . 4 ⊢ (𝑥 = 𝑧 → (◡𝑅 “ {𝑥}) = (◡𝑅 “ {𝑧})) |
20 | 19 | opeliunxp2 5747 | . . 3 ⊢ (〈𝑧, 𝑦〉 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧}))) |
21 | 17, 20 | bitr4di 289 | . 2 ⊢ (ran 𝑅 ⊆ 𝐴 → (〈𝑧, 𝑦〉 ∈ ◡𝑅 ↔ 〈𝑧, 𝑦〉 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})))) |
22 | 1, 5, 21 | eqrelrdv 5702 | 1 ⊢ (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ⊆ wss 3887 {csn 4561 〈cop 4567 ∪ ciun 4924 × cxp 5587 ◡ccnv 5588 dom cdm 5589 ran crn 5590 “ cima 5592 Rel wrel 5594 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-iun 4926 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-cnv 5597 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 |
This theorem is referenced by: gsummpt2co 31308 |
Copyright terms: Public domain | W3C validator |