Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dvdemo1 | Structured version Visualization version GIF version |
Description: Demonstration of a theorem (scheme) that requires (meta)variables 𝑥 and 𝑦 to be distinct, but no others. It bundles the theorem schemes ∃𝑥(𝑥 = 𝑦 → 𝑥 ∈ 𝑥) and ∃𝑥(𝑥 = 𝑦 → 𝑦 ∈ 𝑥). Compare dvdemo2 4903. ("Bundles" is a term introduced by Raph Levien.) (Contributed by NM, 1-Dec-2006.) |
Ref | Expression |
---|---|
dvdemo1 | ⊢ ∃𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dtru 4857 | . . 3 ⊢ ¬ ∀𝑥 𝑥 = 𝑦 | |
2 | exnal 1754 | . . 3 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦) | |
3 | 1, 2 | mpbir 221 | . 2 ⊢ ∃𝑥 ¬ 𝑥 = 𝑦 |
4 | pm2.21 120 | . 2 ⊢ (¬ 𝑥 = 𝑦 → (𝑥 = 𝑦 → 𝑧 ∈ 𝑥)) | |
5 | 3, 4 | eximii 1764 | 1 ⊢ ∃𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1481 ∃wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-nul 4789 ax-pow 4843 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |