![]() |
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 2816 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 275 (to add an intermediate proposition ∃𝑧𝑧 = 𝐴 with a fresh 𝑧), cbvexvw 2032, and eqeq1 2737, requires the core axioms and { ax-9 2114, ax-ext 2704, df-cleq 2725 } whereas this proof requires the core axioms and { ax-8 2106, df-clab 2711, df-clel 2812 }. Theorem bj-issetwt 36818 proves that "existing" is equivalent to being a member of a class abstraction. It also requires, with the present proof, { ax-8 2106, df-clab 2711, df-clel 2812 } (whereas with the shorter proof from cbvexvw 2032 and eqeq1 2737 it would require { ax-8 2106, ax-9 2114, ax-ext 2704, df-clab 2711, df-cleq 2725, df-clel 2812 }). That every class is equal to a class abstraction is proved by abid1 2874, which requires { ax-8 2106, ax-9 2114, ax-ext 2704, df-clab 2711, df-cleq 2725, df-clel 2812 }. Note that there is no disjoint variable condition on 𝑥, 𝑦 but the theorem does not depend on ax-13 2373. Actually, the proof depends only on the logical axioms ax-1 6 through ax-7 2003 and sp 2179. 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 2704 and df-cleq 2725 (e.g., eqid 2733 and eqeq1 2737). In particular, one cannot even prove ⊢ ∃𝑥𝑥 = 𝐴 ⇒ ⊢ 𝐴 = 𝐴 without ax-ext 2704 and df-cleq 2725. (Contributed by BJ, 29-Apr-2019.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
bj-denotesALTV | ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bj-denoteslem 36814 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ 𝐴 ∈ {𝑧 ∣ ⊤}) | |
2 | bj-denoteslem 36814 | . 2 ⊢ (∃𝑦 𝑦 = 𝐴 ↔ 𝐴 ∈ {𝑧 ∣ ⊤}) | |
3 | 1, 2 | bitr4i 278 | 1 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 = wceq 1535 ⊤wtru 1536 ∃wex 1774 ∈ wcel 2104 {cab 2710 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1963 ax-7 2003 ax-8 2106 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1538 df-ex 1775 df-sb 2061 df-clab 2711 df-clel 2812 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |