![]() |
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 6181 | . . . 4 ⊢ ◡◡∩ {𝑥 ∣ 𝜑} = (∩ {𝑥 ∣ 𝜑} ∩ (V × V)) | |
2 | incom 4193 | . . . 4 ⊢ (∩ {𝑥 ∣ 𝜑} ∩ (V × V)) = ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) | |
3 | 1, 2 | eqtri 2752 | . . 3 ⊢ ◡◡∩ {𝑥 ∣ 𝜑} = ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) |
4 | 3 | eleq2i 2817 | . 2 ⊢ (𝐴 ∈ ◡◡∩ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ ((V × V) ∩ ∩ {𝑥 ∣ 𝜑})) |
5 | elinintab 42815 | . 2 ⊢ (𝐴 ∈ ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) | |
6 | 4, 5 | bitri 275 | 1 ⊢ (𝐴 ∈ ◡◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∀wal 1531 ∈ wcel 2098 {cab 2701 Vcvv 3466 ∩ cin 3939 ∩ cint 4940 × cxp 5664 ◡ccnv 5665 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pr 5417 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2702 df-cleq 2716 df-clel 2802 df-ral 3054 df-rab 3425 df-v 3468 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-sn 4621 df-pr 4623 df-op 4627 df-int 4941 df-br 5139 df-opab 5201 df-xp 5672 df-rel 5673 df-cnv 5674 |
This theorem is referenced by: cnvcnvintabd 42840 |
Copyright terms: Public domain | W3C validator |