| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfint2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of class intersection. (Contributed by NM, 28-Jun-1998.) |
| Ref | Expression |
|---|---|
| dfint2 | ⊢ ∩ 𝐴 = {𝑥 ∣ ∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-int 4917 | . 2 ⊢ ∩ 𝐴 = {𝑥 ∣ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 ∈ 𝑦)} | |
| 2 | df-ral 3086 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 ∈ 𝑦)) | |
| 3 | 2 | abbii 2836 | . 2 ⊢ {𝑥 ∣ ∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} = {𝑥 ∣ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 ∈ 𝑦)} |
| 4 | 1, 3 | eqtr4i 2795 | 1 ⊢ ∩ 𝐴 = {𝑥 ∣ ∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1565 = wceq 1567 ∈ wcel 2149 {cab 2747 ∀wral 3085 ∩ cint 4916 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-ral 3086 df-int 4917 |
| This theorem is referenced by: inteq 4919 elintg 4924 nfint 4926 intss 4938 intiin 5028 dfint3 36342 |
| Copyright terms: Public domain | W3C validator |