| 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 3953 | . 2 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ⊆ 𝑋) | |
| 5 | elex 3471 | . 2 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V) | |
| 6 | trud 1580 | . 2 ⊢ (𝑋 ∈ 𝑉 → ⊤) | |
| 7 | 1, 2, 3, 4, 5, 6 | clcnvlem 44567 | 1 ⊢ (𝑋 ∈ 𝑉 → ◡∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ ⊤)} = ∩ {𝑦 ∣ (◡𝑋 ⊆ 𝑦 ∧ ⊤)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ⊤wtru 1571 ∈ wcel 2145 {cab 2738 ∖ cdif 3895 ∪ cun 3896 ⊆ wss 3898 ∩ cint 4906 ◡ccnv 5646 |
| 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 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| 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 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-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-iota 6483 df-fun 6529 df-fv 6535 df-1st 7984 df-2nd 7985 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |