| 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 2092 | . . 3 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) | |
| 2 | df-clab 2720 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ (𝜑 ∧ 𝜓)} ↔ [𝑦 / 𝑥](𝜑 ∧ 𝜓)) | |
| 3 | df-clab 2720 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 4 | df-clab 2720 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 5 | 3, 4 | anbi12i 635 | . . 3 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜓)) |
| 6 | 1, 2, 5 | 3bitr4ri 306 | . 2 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ 𝑦 ∈ {𝑥 ∣ (𝜑 ∧ 𝜓)}) |
| 7 | 6 | ineqri 4144 | 1 ⊢ ({𝑥 ∣ 𝜑} ∩ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∧ 𝜓)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 397 = wceq 1548 [wsb 2074 ∈ wcel 2121 {cab 2719 ∩ cin 3884 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-v 3435 df-in 3892 |
| This theorem is referenced by: inrab 4247 inrab2 4248 dfrab3 4250 orduniss2 7777 ssenen 9083 hashf1lem2 14413 symgsubmefmnd 19368 ballotlem2 34685 fmla0disjsuc 35641 dfiota3 36164 bj-inrab 37295 ptrest 38001 dmxrn 38769 ecqmap 38831 sticksstones22 42668 diophin 43236 |
| Copyright terms: Public domain | W3C validator |