![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > difidALT | Structured version Visualization version GIF version |
Description: Alternate proof of difid 4095. (Contributed by David Abernethy, 17-Jun-2012.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
difidALT | ⊢ (𝐴 ∖ 𝐴) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfdif2 3732 | . 2 ⊢ (𝐴 ∖ 𝐴) = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝐴} | |
2 | dfnul3 4066 | . 2 ⊢ ∅ = {𝑥 ∈ 𝐴 ∣ ¬ 𝑥 ∈ 𝐴} | |
3 | 1, 2 | eqtr4i 2796 | 1 ⊢ (𝐴 ∖ 𝐴) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1631 ∈ wcel 2145 {crab 3065 ∖ cdif 3720 ∅c0 4063 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 835 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-rab 3070 df-v 3353 df-dif 3726 df-nul 4064 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |