Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cnvps | Structured version Visualization version GIF version |
Description: The converse of a poset is a poset. In the general case (◡𝑅 ∈ PosetRel → 𝑅 ∈ PosetRel) is not true. See cnvpsb 18297 for a special case where the property holds. (Contributed by FL, 5-Jan-2009.) (Proof shortened by Mario Carneiro, 3-Sep-2015.) |
Ref | Expression |
---|---|
cnvps | ⊢ (𝑅 ∈ PosetRel → ◡𝑅 ∈ PosetRel) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relcnv 6012 | . . 3 ⊢ Rel ◡𝑅 | |
2 | 1 | a1i 11 | . 2 ⊢ (𝑅 ∈ PosetRel → Rel ◡𝑅) |
3 | cnvco 5794 | . . 3 ⊢ ◡(𝑅 ∘ 𝑅) = (◡𝑅 ∘ ◡𝑅) | |
4 | pstr2 18289 | . . . 4 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∘ 𝑅) ⊆ 𝑅) | |
5 | cnvss 5781 | . . . 4 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 → ◡(𝑅 ∘ 𝑅) ⊆ ◡𝑅) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ (𝑅 ∈ PosetRel → ◡(𝑅 ∘ 𝑅) ⊆ ◡𝑅) |
7 | 3, 6 | eqsstrrid 3970 | . 2 ⊢ (𝑅 ∈ PosetRel → (◡𝑅 ∘ ◡𝑅) ⊆ ◡𝑅) |
8 | psrel 18287 | . . . . . 6 ⊢ (𝑅 ∈ PosetRel → Rel 𝑅) | |
9 | dfrel2 6092 | . . . . . 6 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅) | |
10 | 8, 9 | sylib 217 | . . . . 5 ⊢ (𝑅 ∈ PosetRel → ◡◡𝑅 = 𝑅) |
11 | 10 | ineq2d 4146 | . . . 4 ⊢ (𝑅 ∈ PosetRel → (◡𝑅 ∩ ◡◡𝑅) = (◡𝑅 ∩ 𝑅)) |
12 | incom 4135 | . . . 4 ⊢ (◡𝑅 ∩ 𝑅) = (𝑅 ∩ ◡𝑅) | |
13 | 11, 12 | eqtrdi 2794 | . . 3 ⊢ (𝑅 ∈ PosetRel → (◡𝑅 ∩ ◡◡𝑅) = (𝑅 ∩ ◡𝑅)) |
14 | psref2 18288 | . . 3 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ ◡𝑅) = ( I ↾ ∪ ∪ 𝑅)) | |
15 | relcnvfld 6183 | . . . . 5 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = ∪ ∪ ◡𝑅) | |
16 | 8, 15 | syl 17 | . . . 4 ⊢ (𝑅 ∈ PosetRel → ∪ ∪ 𝑅 = ∪ ∪ ◡𝑅) |
17 | 16 | reseq2d 5891 | . . 3 ⊢ (𝑅 ∈ PosetRel → ( I ↾ ∪ ∪ 𝑅) = ( I ↾ ∪ ∪ ◡𝑅)) |
18 | 13, 14, 17 | 3eqtrd 2782 | . 2 ⊢ (𝑅 ∈ PosetRel → (◡𝑅 ∩ ◡◡𝑅) = ( I ↾ ∪ ∪ ◡𝑅)) |
19 | cnvexg 7771 | . . 3 ⊢ (𝑅 ∈ PosetRel → ◡𝑅 ∈ V) | |
20 | isps 18286 | . . 3 ⊢ (◡𝑅 ∈ V → (◡𝑅 ∈ PosetRel ↔ (Rel ◡𝑅 ∧ (◡𝑅 ∘ ◡𝑅) ⊆ ◡𝑅 ∧ (◡𝑅 ∩ ◡◡𝑅) = ( I ↾ ∪ ∪ ◡𝑅)))) | |
21 | 19, 20 | syl 17 | . 2 ⊢ (𝑅 ∈ PosetRel → (◡𝑅 ∈ PosetRel ↔ (Rel ◡𝑅 ∧ (◡𝑅 ∘ ◡𝑅) ⊆ ◡𝑅 ∧ (◡𝑅 ∩ ◡◡𝑅) = ( I ↾ ∪ ∪ ◡𝑅)))) |
22 | 2, 7, 18, 21 | mpbir3and 1341 | 1 ⊢ (𝑅 ∈ PosetRel → ◡𝑅 ∈ PosetRel) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∩ cin 3886 ⊆ wss 3887 ∪ cuni 4839 I cid 5488 ◡ccnv 5588 ↾ cres 5591 ∘ ccom 5593 Rel wrel 5594 PosetRelcps 18282 |
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-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
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-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ps 18284 |
This theorem is referenced by: cnvpsb 18297 cnvtsr 18306 ordtcnv 22352 xrge0iifhmeo 31886 |
Copyright terms: Public domain | W3C validator |