![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > elinintab | Structured version Visualization version GIF version |
Description: Two ways of saying a set is an element of the intersection of a class with the intersection of a class. (Contributed by RP, 13-Aug-2020.) |
Ref | Expression |
---|---|
elinintab | ⊢ (𝐴 ∈ (𝐵 ∩ ∩ {𝑥 ∣ 𝜑}) ↔ (𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3959 | . 2 ⊢ (𝐴 ∈ (𝐵 ∩ ∩ {𝑥 ∣ 𝜑}) ↔ (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ ∩ {𝑥 ∣ 𝜑})) | |
2 | elintabg 4954 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ ∩ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) | |
3 | 2 | pm5.32i 574 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ ∩ {𝑥 ∣ 𝜑}) ↔ (𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) |
4 | 1, 3 | bitri 275 | 1 ⊢ (𝐴 ∈ (𝐵 ∩ ∩ {𝑥 ∣ 𝜑}) ↔ (𝐴 ∈ 𝐵 ∧ ∀𝑥(𝜑 → 𝐴 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∀wal 1531 ∈ wcel 2098 {cab 2703 ∩ cin 3942 ∩ cint 4943 |
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 2697 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-ral 3056 df-v 3470 df-in 3950 df-int 4944 |
This theorem is referenced by: inintabss 42905 inintabd 42906 elcnvcnvintab 42909 |
Copyright terms: Public domain | W3C validator |