| 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 4396 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐴 ∈ 𝐵) → (𝐶 ∩ 𝐵) ≠ ∅) | |
| 2 | 1 | expcom 415 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ 𝐶 → (𝐶 ∩ 𝐵) ≠ ∅)) |
| 3 | 2 | necon2bd 2952 | . 2 ⊢ (𝐴 ∈ 𝐵 → ((𝐶 ∩ 𝐵) = ∅ → ¬ 𝐴 ∈ 𝐶)) |
| 4 | 3 | imp 408 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ (𝐶 ∩ 𝐵) = ∅) → ¬ 𝐴 ∈ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 ∩ cin 3884 ∅c0 4264 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ne 2937 df-v 3435 df-dif 3888 df-in 3892 df-nul 4265 |
| This theorem is referenced by: peano5 7837 fnsuppres 8135 domunfican 9226 unwdomg 9493 dfac5 10046 ccatval2 14535 mreexexlem2d 17606 hauspwpwf1 23974 noinfepfnregs 35328 |
| Copyright terms: Public domain | W3C validator |