| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cnvtrucl0 | Structured version Visualization version GIF version | ||
| Description: The converse of the trivial closure is equal to the closure of the converse. (Contributed by RP, 18-Oct-2020.) |
| Ref | Expression |
|---|---|
| cnvtrucl0 | ⊢ (𝑋 ∈ 𝑉 → ◡∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ ⊤)} = ∩ {𝑦 ∣ (◡𝑋 ⊆ 𝑦 ∧ ⊤)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | idd 25 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑥 = (◡𝑦 ∪ (𝑋 ∖ ◡◡𝑋))) → (⊤ → ⊤)) | |
| 2 | idd 25 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 = ◡𝑥) → (⊤ → ⊤)) | |
| 3 | biidd 265 | . 2 ⊢ (𝑥 = 𝑋 → (⊤ ↔ ⊤)) | |
| 4 | ssidd 3957 | . 2 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ⊆ 𝑋) | |
| 5 | elex 3474 | . 2 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V) | |
| 6 | trud 1580 | . 2 ⊢ (𝑋 ∈ 𝑉 → ⊤) | |
| 7 | 1, 2, 3, 4, 5, 6 | clcnvlem 44450 | 1 ⊢ (𝑋 ∈ 𝑉 → ◡∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ ⊤)} = ∩ {𝑦 ∣ (◡𝑋 ⊆ 𝑦 ∧ ⊤)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ⊤wtru 1571 ∈ wcel 2145 {cab 2740 ∖ cdif 3899 ∪ cun 3900 ⊆ wss 3902 ∩ cint 4910 ◡ccnv 5658 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-iota 6493 df-fun 6539 df-fv 6545 df-1st 7989 df-2nd 7990 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |