Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > inab | Structured version Visualization version GIF version |
Description: Intersection of two class abstractions. (Contributed by NM, 29-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
Ref | Expression |
---|---|
inab | ⊢ ({𝑥 ∣ 𝜑} ∩ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∧ 𝜓)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sban 2086 | . . 3 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) | |
2 | df-clab 2800 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ (𝜑 ∧ 𝜓)} ↔ [𝑦 / 𝑥](𝜑 ∧ 𝜓)) | |
3 | df-clab 2800 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
4 | df-clab 2800 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
5 | 3, 4 | anbi12i 628 | . . 3 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) |
6 | 1, 2, 5 | 3bitr4ri 306 | . 2 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ 𝑦 ∈ {𝑥 ∣ (𝜑 ∧ 𝜓)}) |
7 | 6 | ineqri 4180 | 1 ⊢ ({𝑥 ∣ 𝜑} ∩ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∧ 𝜓)} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 = wceq 1537 [wsb 2069 ∈ wcel 2114 {cab 2799 ∩ cin 3935 |
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 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-in 3943 |
This theorem is referenced by: inrab 4275 inrab2 4276 dfrab3 4278 orduniss2 7548 ssenen 8691 hashf1lem2 13815 symgsubmefmnd 18526 ballotlem2 31746 fmla0disjsuc 32645 dfiota3 33384 bj-inrab 34248 ptrest 34906 diophin 39389 |
Copyright terms: Public domain | W3C validator |