| Mathbox for BJ | < Previous  
      Next > Nearby theorems | ||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-aecomsv | Structured version Visualization version GIF version | ||
| Description: Version of aecoms 2433 with a disjoint variable condition, provable from Tarski's FOL. The corresponding version of naecoms 2434 should not be very useful since ¬ ∀𝑥𝑥 = 𝑦, DV (𝑥, 𝑦) is true when the universe has at least two objects (see dtru 5441). (Contributed by BJ, 31-May-2019.) (Proof modification is discouraged.) | 
| Ref | Expression | 
|---|---|
| bj-aecomsv.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) | 
| Ref | Expression | 
|---|---|
| bj-aecomsv | ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | aevlem 2055 | . 2 ⊢ (∀𝑦 𝑦 = 𝑥 → ∀𝑥 𝑥 = 𝑦) | |
| 2 | bj-aecomsv.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∀wal 1538 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 | 
| This theorem is referenced by: bj-axc11v 36810 | 
| Copyright terms: Public domain | W3C validator |