Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cleljustALT2 | Structured version Visualization version GIF version |
Description: Alternate proof of cleljust 2119. Compared with cleljustALT 2378, it uses nfv 1911 followed by equsexv 2265 instead of ax-5 1907 followed by equsexhv 2296, so it uses the idiom Ⅎ𝑥𝜑 instead of 𝜑 → ∀𝑥𝜑 to express non-freeness. This style is generally preferred for later theorems. (Contributed by NM, 28-Jan-2004.) (Revised by Mario Carneiro, 21-Dec-2016.) (Revised by BJ, 29-Dec-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cleljustALT2 | ⊢ (𝑥 ∈ 𝑦 ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1911 | . . 3 ⊢ Ⅎ𝑧 𝑥 ∈ 𝑦 | |
2 | elequ1 2117 | . . 3 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦)) | |
3 | 1, 2 | equsexv 2265 | . 2 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ 𝑦) ↔ 𝑥 ∈ 𝑦) |
4 | 3 | bicomi 226 | 1 ⊢ (𝑥 ∈ 𝑦 ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∃wex 1776 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-12 2173 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-nf 1781 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |