| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > minel | Structured version Visualization version GIF version | ||
| Description: A minimum element of a class has no elements in common with the class. (Contributed by NM, 22-Jun-1994.) (Proof shortened by JJ, 14-Jul-2021.) |
| Ref | Expression |
|---|---|
| minel | ⊢ ((𝐴 ∈ 𝐵 ∧ (𝐶 ∩ 𝐵) = ∅) → ¬ 𝐴 ∈ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inelcm 4421 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐴 ∈ 𝐵) → (𝐶 ∩ 𝐵) ≠ ∅) | |
| 2 | 1 | expcom 419 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ 𝐶 → (𝐶 ∩ 𝐵) ≠ ∅)) |
| 3 | 2 | necon2bd 2975 | . 2 ⊢ (𝐴 ∈ 𝐵 → ((𝐶 ∩ 𝐵) = ∅ → ¬ 𝐴 ∈ 𝐶)) |
| 4 | 3 | imp 412 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ (𝐶 ∩ 𝐵) = ∅) → ¬ 𝐴 ∈ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∩ cin 4092 ∅c0 4281 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-v 3456 df-dif 4050 df-in 4094 df-nul 4282 |
| This theorem is used by: peano5 7939 fnsuppres 8246 domunfican 9351 unwdomg 9615 dfac5 10246 ccatval2 14764 mreexexlem2d 17869 hauspwpwf1 24361 noinfepfnregs 35941 |
| Copyright terms: Public domain | W3C validator |