|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > naev | Structured version Visualization version GIF version | ||
| Description: If some set variables can assume different values, then any two distinct set variables cannot always be the same. (Contributed by Wolf Lammen, 10-Aug-2019.) | 
| Ref | Expression | 
|---|---|
| naev | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑢 𝑢 = 𝑣) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | aev 2056 | . 2 ⊢ (∀𝑢 𝑢 = 𝑣 → ∀𝑥 𝑥 = 𝑦) | |
| 2 | 1 | con3i 154 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑢 𝑢 = 𝑣) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1537 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1779 | 
| This theorem is referenced by: naev2 2060 wl-sbcom2d-lem2 37562 wl-sbal1 37565 wl-sbal2 37566 wl-ax11-lem3 37589 | 
| Copyright terms: Public domain | W3C validator |