Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 19.9v | Structured version Visualization version GIF version |
Description: Version of 19.9 2201 with a disjoint variable condition, requiring fewer axioms. Any formula can be existentially quantified using a variable which it does not contain. See also 19.3v 1986. (Contributed by NM, 28-May-1995.) Remove dependency on ax-7 2012. (Revised by Wolf Lammen, 4-Dec-2017.) |
Ref | Expression |
---|---|
19.9v | ⊢ (∃𝑥𝜑 ↔ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax5e 1916 | . 2 ⊢ (∃𝑥𝜑 → 𝜑) | |
2 | 19.8v 1987 | . 2 ⊢ (𝜑 → ∃𝑥𝜑) | |
3 | 1, 2 | impbii 208 | 1 ⊢ (∃𝑥𝜑 ↔ 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∃wex 1783 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 |
This theorem depends on definitions: df-bi 206 df-ex 1784 |
This theorem is referenced by: 19.36v 1992 19.44v 1997 19.45v 1998 zfcndpow 10303 volfiniune 32098 bnj937 32651 bnj594 32792 bnj907 32847 bnj1128 32870 bnj1145 32873 coss0 36524 prter2 36822 relopabVD 42410 rfcnnnub 42468 |
Copyright terms: Public domain | W3C validator |