| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-issetw | Structured version Visualization version GIF version | ||
| Description: The closest one can get to isset 3467 without using ax-ext 2734. See also vexw 2746. Note that the only disjoint variable condition is between 𝑦 and 𝐴. From there, one can prove isset 3467 using eleq2i 2854 (which requires ax-ext 2734 and df-cleq 2754). (Contributed by BJ, 29-Apr-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| bj-issetw.1 | ⊢ 𝜑 |
| Ref | Expression |
|---|---|
| bj-issetw | ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑦 𝑦 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-issetwt 37605 | . 2 ⊢ (∀𝑥𝜑 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑦 𝑦 = 𝐴)) | |
| 2 | bj-issetw.1 | . 2 ⊢ 𝜑 | |
| 3 | 1, 2 | mpg 1830 | 1 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑦 𝑦 = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∃wex 1812 ∈ wcel 2145 {cab 2740 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2741 df-clel 2837 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |