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 2823 | . . 3 ⊢ (𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉) = (𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉) | |
2 | 1 | elcnvlem 39968 | . 2 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉)‘𝐴) ∈ ∩ {𝑥 ∣ 𝜑})) |
3 | 1 | elcnvlem 39968 | . 2 ⊢ (𝐴 ∈ ◡𝑥 ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ 〈(2nd ‘𝑦), (1st ‘𝑦)〉)‘𝐴) ∈ 𝑥)) |
4 | 2, 3 | elmapintab 39963 | 1 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1535 ∈ wcel 2114 {cab 2801 Vcvv 3496 〈cop 4575 ∩ cint 4878 ↦ cmpt 5148 × cxp 5555 ◡ccnv 5556 ‘cfv 6357 1st c1st 7689 2nd c2nd 7690 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-int 4879 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-iota 6316 df-fun 6359 df-fv 6365 df-1st 7691 df-2nd 7692 |
This theorem is referenced by: cnvintabd 39970 |
Copyright terms: Public domain | W3C validator |