Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elrint | Structured version Visualization version GIF version |
Description: Membership in a restricted intersection. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
Ref | Expression |
---|---|
elrint | ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3796 | . 2 ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ ∩ 𝐵)) | |
2 | elintg 4483 | . . 3 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦)) | |
3 | 2 | pm5.32i 669 | . 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦)) |
4 | 1, 3 | bitri 264 | 1 ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 ∈ wcel 1990 ∀wral 2912 ∩ cin 3573 ∩ cint 4475 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-v 3202 df-in 3581 df-int 4476 |
This theorem is referenced by: elrint2 4519 ptcnplem 21424 tmdgsum2 21900 limciun 23658 |
Copyright terms: Public domain | W3C validator |