![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > elcnvcnvintab | Structured version Visualization version GIF version |
Description: Two ways of saying a set is an element of the converse of the converse of the intersection of a class. (Contributed by RP, 20-Aug-2020.) |
Ref | Expression |
---|---|
elcnvcnvintab | ⊢ (𝐴 ∈ ◡◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnvcnv 6016 | . . . 4 ⊢ ◡◡∩ {𝑥 ∣ 𝜑} = (∩ {𝑥 ∣ 𝜑} ∩ (V × V)) | |
2 | incom 4128 | . . . 4 ⊢ (∩ {𝑥 ∣ 𝜑} ∩ (V × V)) = ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) | |
3 | 1, 2 | eqtri 2821 | . . 3 ⊢ ◡◡∩ {𝑥 ∣ 𝜑} = ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) |
4 | 3 | eleq2i 2881 | . 2 ⊢ (𝐴 ∈ ◡◡∩ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ ((V × V) ∩ ∩ {𝑥 ∣ 𝜑})) |
5 | elinintab 40275 | . 2 ⊢ (𝐴 ∈ ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) | |
6 | 4, 5 | bitri 278 | 1 ⊢ (𝐴 ∈ ◡◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∀wal 1536 ∈ wcel 2111 {cab 2776 Vcvv 3441 ∩ cin 3880 ∩ cint 4838 × cxp 5517 ◡ccnv 5518 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-int 4839 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 |
This theorem is referenced by: cnvcnvintabd 40300 |
Copyright terms: Public domain | W3C validator |