| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > naecoms | GIF version | ||
| Description: A commutation rule for distinct variable specifiers. (Contributed by NM, 2-Jan-2002.) | 
| Ref | Expression | 
|---|---|
| naecoms.1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑) | 
| Ref | Expression | 
|---|---|
| naecoms | ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | ax-10 1519 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥) | |
| 2 | 1 | con3i 633 | . 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → ¬ ∀𝑥 𝑥 = 𝑦) | 
| 3 | naecoms.1 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑) | |
| 4 | 2, 3 | syl 14 | 1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑) | 
| Colors of variables: wff set class | 
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1362 = wceq 1364 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-in1 615 ax-in2 616 ax-10 1519 | 
| This theorem is referenced by: nfcvf2 2363 | 
| Copyright terms: Public domain | W3C validator |