| 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 3959 | . 2 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ⊆ 𝑋) | |
| 5 | elex 3475 | . 2 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V) | |
| 6 | trud 1579 | . 2 ⊢ (𝑋 ∈ 𝑉 → ⊤) | |
| 7 | 1, 2, 3, 4, 5, 6 | clcnvlem 44377 | 1 ⊢ (𝑋 ∈ 𝑉 → ◡∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ ⊤)} = ∩ {𝑦 ∣ (◡𝑋 ⊆ 𝑦 ∧ ⊤)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1569 ⊤wtru 1570 ∈ wcel 2142 {cab 2740 ∖ cdif 3901 ∪ cun 3902 ⊆ wss 3904 ∩ cint 4911 ◡ccnv 5659 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-iota 6492 df-fun 6538 df-fv 6544 df-1st 7984 df-2nd 7985 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |