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 3984 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐴 ∈ 𝐵) → (𝐶 ∩ 𝐵) ≠ ∅) | |
2 | 1 | expcom 450 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ 𝐶 → (𝐶 ∩ 𝐵) ≠ ∅)) |
3 | 2 | necon2bd 2798 | . 2 ⊢ (𝐴 ∈ 𝐵 → ((𝐶 ∩ 𝐵) = ∅ → ¬ 𝐴 ∈ 𝐶)) |
4 | 3 | imp 444 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ (𝐶 ∩ 𝐵) = ∅) → ¬ 𝐴 ∈ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∩ cin 3539 ∅c0 3874 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-v 3175 df-dif 3543 df-in 3547 df-nul 3875 |
This theorem is referenced by: peano5 6981 fnsuppres 7209 domunfican 8118 unwdomg 8372 dfac5 8834 ccatval2 13215 mreexexlem2d 16128 hauspwpwf1 21601 |
Copyright terms: Public domain | W3C validator |