| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oduval | Structured version Visualization version GIF version | ||
| Description: Value of an order dual structure. (Contributed by Stefan O'Rear, 29-Jan-2015.) |
| Ref | Expression |
|---|---|
| oduval.d | ⊢ 𝐷 = (ODual‘𝑂) |
| oduval.l | ⊢ ≤ = (le‘𝑂) |
| Ref | Expression |
|---|---|
| oduval | ⊢ 𝐷 = (𝑂 sSet 〈(le‘ndx), ◡ ≤ 〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . . 5 ⊢ (𝑎 = 𝑂 → 𝑎 = 𝑂) | |
| 2 | fveq2 6890 | . . . . . . 7 ⊢ (𝑎 = 𝑂 → (le‘𝑎) = (le‘𝑂)) | |
| 3 | 2 | cnveqd 5854 | . . . . . 6 ⊢ (𝑎 = 𝑂 → ◡(le‘𝑎) = ◡(le‘𝑂)) |
| 4 | 3 | opeq2d 4846 | . . . . 5 ⊢ (𝑎 = 𝑂 → 〈(le‘ndx), ◡(le‘𝑎)〉 = 〈(le‘ndx), ◡(le‘𝑂)〉) |
| 5 | 1, 4 | oveq12d 7442 | . . . 4 ⊢ (𝑎 = 𝑂 → (𝑎 sSet 〈(le‘ndx), ◡(le‘𝑎)〉) = (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉)) |
| 6 | df-odu 18470 | . . . 4 ⊢ ODual = (𝑎 ∈ V ↦ (𝑎 sSet 〈(le‘ndx), ◡(le‘𝑎)〉)) | |
| 7 | ovex 7457 | . . . 4 ⊢ (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉) ∈ V | |
| 8 | 5, 6, 7 | fvmpt 6998 | . . 3 ⊢ (𝑂 ∈ V → (ODual‘𝑂) = (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉)) |
| 9 | fvprc 6882 | . . . 4 ⊢ (¬ 𝑂 ∈ V → (ODual‘𝑂) = ∅) | |
| 10 | reldmsets 17352 | . . . . 5 ⊢ Rel dom sSet | |
| 11 | 10 | ovprc1 7463 | . . . 4 ⊢ (¬ 𝑂 ∈ V → (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉) = ∅) |
| 12 | 9, 11 | eqtr4d 2798 | . . 3 ⊢ (¬ 𝑂 ∈ V → (ODual‘𝑂) = (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉)) |
| 13 | 8, 12 | pm2.61i 184 | . 2 ⊢ (ODual‘𝑂) = (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉) |
| 14 | oduval.d | . 2 ⊢ 𝐷 = (ODual‘𝑂) | |
| 15 | oduval.l | . . . . 5 ⊢ ≤ = (le‘𝑂) | |
| 16 | 15 | cnveqi 5853 | . . . 4 ⊢ ◡ ≤ = ◡(le‘𝑂) |
| 17 | 16 | opeq2i 4843 | . . 3 ⊢ 〈(le‘ndx), ◡ ≤ 〉 = 〈(le‘ndx), ◡(le‘𝑂)〉 |
| 18 | 17 | oveq2i 7435 | . 2 ⊢ (𝑂 sSet 〈(le‘ndx), ◡ ≤ 〉) = (𝑂 sSet 〈(le‘ndx), ◡(le‘𝑂)〉) |
| 19 | 13, 14, 18 | 3eqtr4i 2793 | 1 ⊢ 𝐷 = (𝑂 sSet 〈(le‘ndx), ◡ ≤ 〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4277 〈cop 4834 ◡ccnv 5650 ‘cfv 6543 (class class class)co 7424 sSet csts 17350 ndxcnx 17380 lecple 17444 ODualcodu 18469 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6497 df-fun 6545 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-sets 17351 df-odu 18470 |
| This theorem is used by: oduleval 18472 odubas 18474 |
| Copyright terms: Public domain | W3C validator |