Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eq0rdv | Structured version Visualization version GIF version |
Description: Deduction for equality to the empty set. (Contributed by NM, 11-Jul-2014.) |
Ref | Expression |
---|---|
eq0rdv.1 | ⊢ (𝜑 → ¬ 𝑥 ∈ 𝐴) |
Ref | Expression |
---|---|
eq0rdv | ⊢ (𝜑 → 𝐴 = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eq0rdv.1 | . . . 4 ⊢ (𝜑 → ¬ 𝑥 ∈ 𝐴) | |
2 | 1 | pm2.21d 121 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∅)) |
3 | 2 | ssrdv 3972 | . 2 ⊢ (𝜑 → 𝐴 ⊆ ∅) |
4 | ss0 4351 | . 2 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅) | |
5 | 3, 4 | syl 17 | 1 ⊢ (𝜑 → 𝐴 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1533 ∈ wcel 2110 ⊆ wss 3935 ∅c0 4290 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-dif 3938 df-in 3942 df-ss 3951 df-nul 4291 |
This theorem is referenced by: map0b 8441 disjen 8668 mapdom1 8676 pwxpndom2 10081 fzdisj 12928 smu01lem 15828 prmreclem5 16250 vdwap0 16306 natfval 17210 fucbas 17224 fuchom 17225 coafval 17318 efgval 18837 lsppratlem6 19918 lbsextlem4 19927 psrvscafval 20164 cfinufil 22530 ufinffr 22531 fin1aufil 22534 bldisj 23002 reconnlem1 23428 pcofval 23608 bcthlem5 23925 volfiniun 24142 fta1g 24755 fta1 24891 rpvmasum 26096 unblimceq0 33841 bj-projval 34303 finxpnom 34676 ipo0 40774 ifr0 40775 limclner 41925 |
Copyright terms: Public domain | W3C validator |