| 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 4915 | . 2 ⊢ ∩ 𝐴 = {𝑥 ∣ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 ∈ 𝑦)} | |
| 2 | df-ral 3082 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 ∈ 𝑦)) | |
| 3 | 2 | abbii 2832 | . 2 ⊢ {𝑥 ∣ ∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} = {𝑥 ∣ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 ∈ 𝑦)} |
| 4 | 1, 3 | eqtr4i 2791 | 1 ⊢ ∩ 𝐴 = {𝑥 ∣ ∀𝑦 ∈ 𝐴 𝑥 ∈ 𝑦} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1568 = wceq 1570 ∈ wcel 2146 {cab 2743 ∀wral 3081 ∩ cint 4914 |
| 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-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-ral 3082 df-int 4915 |
| This theorem is used by: inteq 4917 elintg 4922 nfint 4924 intss 4936 intiin 5026 dfint3 36481 |
| Copyright terms: Public domain | W3C validator |