Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rexin | Structured version Visualization version GIF version |
Description: Restricted existential quantification over intersection. (Contributed by Peter Mazsa, 17-Dec-2018.) |
Ref | Expression |
---|---|
rexin | ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 4162 | . . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
2 | 1 | anbi1i 625 | . . 3 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ 𝜑)) |
3 | anass 471 | . . 3 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ 𝜑))) | |
4 | 2, 3 | bitri 277 | . 2 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∧ 𝜑))) |
5 | 4 | rexbii2 3244 | 1 ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∈ wcel 2113 ∃wrex 3138 ∩ cin 3928 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-rex 3143 df-v 3493 df-in 3936 |
This theorem is referenced by: wefrc 5542 elidinxp 5904 bnd2 9315 subislly 22084 pcmplfin 31148 imaindm 33043 |
Copyright terms: Public domain | W3C validator |