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 6110 | . . . 4 ⊢ ◡◡∩ {𝑥 ∣ 𝜑} = (∩ {𝑥 ∣ 𝜑} ∩ (V × V)) | |
2 | incom 4141 | . . . 4 ⊢ (∩ {𝑥 ∣ 𝜑} ∩ (V × V)) = ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) | |
3 | 1, 2 | eqtri 2764 | . . 3 ⊢ ◡◡∩ {𝑥 ∣ 𝜑} = ((V × V) ∩ ∩ {𝑥 ∣ 𝜑}) |
4 | 3 | eleq2i 2828 | . 2 ⊢ (𝐴 ∈ ◡◡∩ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ ((V × V) ∩ ∩ {𝑥 ∣ 𝜑})) |
5 | elinintab 41221 | . 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 397 ∀wal 1537 ∈ wcel 2104 {cab 2713 Vcvv 3437 ∩ cin 3891 ∩ cint 4886 × cxp 5598 ◡ccnv 5599 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pr 5361 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-ral 3063 df-rab 3287 df-v 3439 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4566 df-pr 4568 df-op 4572 df-int 4887 df-br 5082 df-opab 5144 df-xp 5606 df-rel 5607 df-cnv 5608 |
This theorem is referenced by: cnvcnvintabd 41246 |
Copyright terms: Public domain | W3C validator |