| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elcnvintab | Structured version Visualization version GIF version | ||
| Description: Two ways of saying a set is an element of the converse of the intersection of a class. (Contributed by RP, 19-Aug-2020.) |
| Ref | Expression |
|---|---|
| elcnvintab | ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . 3 ⊢ (𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉) = (𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉) | |
| 2 | 1 | elcnvlem 44297 | . 2 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉)‘𝐴) ∈ ∩ {𝑥 ∣ 𝜑})) |
| 3 | 1 | elcnvlem 44297 | . 2 ⊢ (𝐴 ∈ ◡𝑥 ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉)‘𝐴) ∈ 𝑥)) |
| 4 | 2, 3 | elmapintab 44292 | 1 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1566 ∈ wcel 2141 {cab 2739 Vcvv 3453 〈cop 4594 ∩ cint 4911 ↦ cmpt 5191 × cxp 5659 ◡ccnv 5660 ‘cfv 6536 1st c1st 7983 2nd c2nd 7984 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3415 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 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 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-iota 6492 df-fun 6538 df-fv 6544 df-1st 7985 df-2nd 7986 |
| This theorem is referenced by: cnvintabd 44299 |
| Copyright terms: Public domain | W3C validator |