| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-denotesALTV | Structured version Visualization version GIF version | ||
| Description: Moved to main as iseqsetv-clel 2843 and kept for the comments.
This would be the justification theorem for the definition of the unary predicate "E!" by ⊢ ( E! 𝐴 ↔ ∃𝑥𝑥 = 𝐴) which could be interpreted as "𝐴 exists" (as a set) or "𝐴 denotes" (in the sense of free logic). A shorter proof using bitri 278 (to add an intermediate proposition ∃𝑧𝑧 = 𝐴 with a fresh 𝑧), cbvexvw 2072, and eqeq1 2767, requires the core axioms and { ax-9 2157, ax-ext 2735, df-cleq 2755 } whereas this proof requires the core axioms and { ax-8 2149, df-clab 2742, df-clel 2839 }. Theorem bj-issetwt 38002 proves that "existing" is equivalent to being a member of a class abstraction. It also requires, with the present proof, { ax-8 2149, df-clab 2742, df-clel 2839 } (whereas with the shorter proof from cbvexvw 2072 and eqeq1 2767 it would require { ax-8 2149, ax-9 2157, ax-ext 2735, df-clab 2742, df-cleq 2755, df-clel 2839 }). That every class is equal to a class abstraction is proved by abid1 2900, which requires { ax-8 2149, ax-9 2157, ax-ext 2735, df-clab 2742, df-cleq 2755, df-clel 2839 }. There is no disjoint variable condition on 𝑥, 𝑦 but the theorem does not depend on ax-13 2404. Actually, the proof depends only on the logical axioms ax-1 6 through ax-7 2043 and sp 2223. The symbol "E!" was chosen to be reminiscent of the analogous predicate in (inclusive or non-inclusive) free logic, which deals with the possibility of nonexistent objects. This analogy should not be taken too far, since here there are no equality axioms for classes: these are derived from ax-ext 2735 and df-cleq 2755 (e.g., eqid 2763 and eqeq1 2767). In particular, one cannot even prove ⊢ ∃𝑥𝑥 = 𝐴 ⇒ ⊢ 𝐴 = 𝐴 without ax-ext 2735 and df-cleq 2755. (Contributed by BJ, 29-Apr-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| bj-denotesALTV | ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-denoteslem 37998 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ 𝐴 ∈ {𝑧 ∣ ⊤}) | |
| 2 | bj-denoteslem 37998 | . 2 ⊢ (∃𝑦 𝑦 = 𝐴 ↔ 𝐴 ∈ {𝑧 ∣ ⊤}) | |
| 3 | 1, 2 | bitr4i 281 | 1 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ⊤wtru 1571 ∃wex 1812 ∈ wcel 2147 {cab 2741 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-clel 2839 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |