| 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 2756 | . . 3 ⊢ (𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉) = (𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉) | |
| 2 | 1 | elcnvlem 44125 | . 2 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉)‘𝐴) ∈ ∩ {𝑥 ∣ 𝜑})) |
| 3 | 1 | elcnvlem 44125 | . 2 ⊢ (𝐴 ∈ ◡𝑥 ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉)‘𝐴) ∈ 𝑥)) |
| 4 | 2, 3 | elmapintab 44120 | 1 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1552 ∈ wcel 2136 {cab 2734 Vcvv 3448 〈cop 4582 ∩ cint 4899 ↦ cmpt 5175 × cxp 5638 ◡ccnv 5639 ‘cfv 6510 1st c1st 7957 2nd c2nd 7958 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pr 5384 ax-un 7707 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4281 df-if 4475 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4900 df-br 5095 df-opab 5157 df-mpt 5176 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-iota 6466 df-fun 6512 df-fv 6518 df-1st 7959 df-2nd 7960 |
| This theorem is referenced by: cnvintabd 44127 |
| Copyright terms: Public domain | W3C validator |