| 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 2117 | . . 3 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) | |
| 2 | df-clab 2740 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ (𝜑 ∧ 𝜓)} ↔ [𝑦 / 𝑥](𝜑 ∧ 𝜓)) | |
| 3 | df-clab 2740 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 4 | df-clab 2740 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 5 | 3, 4 | anbi12i 640 | . . 3 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) |
| 6 | 1, 2, 5 | 3bitr4ri 307 | . 2 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ 𝑦 ∈ {𝑥 ∣ (𝜑 ∧ 𝜓)}) |
| 7 | 6 | ineqri 4158 | 1 ⊢ ({𝑥 ∣ 𝜑} ∩ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∧ 𝜓)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 [wsb 2099 ∈ wcel 2145 {cab 2739 ∩ cin 3898 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-in 3906 |
| This theorem is used by: inrab 4262 inrab2 4263 dfrab3 4265 orduniss2 7833 ssenen 9154 hashf1lem2 14581 symgsubmefmnd 19592 ballotlem2 35104 fmla0disjsuc 36132 dfiota3 36655 bj-inrab 37810 ptrest 38505 dmxrn 39287 ecqmap 39349 sticksstones22 43186 diophin 43736 |
| Copyright terms: Public domain | W3C validator |