![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfrab3 | Structured version Visualization version GIF version |
Description: Alternate definition of restricted class abstraction. (Contributed by Mario Carneiro, 8-Sep-2013.) |
Ref | Expression |
---|---|
dfrab3 | ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = (𝐴 ∩ {𝑥 ∣ 𝜑}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rab 3115 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
2 | inab 4223 | . 2 ⊢ ({𝑥 ∣ 𝑥 ∈ 𝐴} ∩ {𝑥 ∣ 𝜑}) = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
3 | abid2 2932 | . . 3 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 | |
4 | 3 | ineq1i 4135 | . 2 ⊢ ({𝑥 ∣ 𝑥 ∈ 𝐴} ∩ {𝑥 ∣ 𝜑}) = (𝐴 ∩ {𝑥 ∣ 𝜑}) |
5 | 1, 2, 4 | 3eqtr2i 2827 | 1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = (𝐴 ∩ {𝑥 ∣ 𝜑}) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 = wceq 1538 ∈ wcel 2111 {cab 2776 {crab 3110 ∩ cin 3880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-tru 1541 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-rab 3115 df-v 3443 df-in 3888 |
This theorem is referenced by: dfrab2 4231 notrab 4232 dfrab3ss 4233 dfif3 4439 dffr3 5929 dfse2 5930 tz6.26 6147 rabfi 8727 dfsup2 8892 ressmplbas2 20695 clsocv 23854 hasheuni 31454 bj-inrab3 34371 bj-reabeq 34463 hashnzfz 41024 |
Copyright terms: Public domain | W3C validator |