Theorem bj-denotes 34983

Description: 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 274 (to add an intermediate proposition ∃𝑧𝑧 = 𝐴 with a fresh 𝑧), cbvexvw 2041, and eqeq1 2742, requires the core axioms and { ax-9 2118, ax-ext 2709, df-cleq 2730 } whereas this proof requires the core axioms and { ax-8 2110, df-clab 2716, df-clel 2817 }.

Theorem bj-issetwt 34986 proves that "existing" is equivalent to being a member of a class abstraction. It also requires, with the present proof, { ax-8 2110, df-clab 2716, df-clel 2817 } (whereas with the shorter proof from cbvexvw 2041 and eqeq1 2742 it would require { ax-8 2110, ax-9 2118, ax-ext 2709, df-clab 2716, df-cleq 2730, df-clel 2817 }). That every class is equal to a class abstraction is proved by abid1 2880, which requires { ax-8 2110, ax-9 2118, ax-ext 2709, df-clab 2716, df-cleq 2730, df-clel 2817 }.

Note that there is no disjoint variable condition on 𝑥, 𝑦 but the theorem does not depend on ax-13 2372. Actually, the proof depends only on the logical axioms ax-1 6 through ax-7 2012 and sp 2178.

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 2709 and df-cleq 2730 (e.g., eqid 2738 and eqeq1 2742). In particular, one cannot even prove ⊢ ∃𝑥𝑥 = 𝐴 ⇒ ⊢ 𝐴 = 𝐴 without ax-ext 2709 and df-cleq 2730.

(Contributed by BJ, 29-Apr-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-denotes	⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴)

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

Proof of Theorem bj-denotes

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bj-denoteslem 34982	. 2 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ 𝐴 ∈ {𝑧 ∣ ⊤})
2		bj-denoteslem 34982	. 2 ⊢ (∃𝑦 𝑦 = 𝐴 ↔ 𝐴 ∈ {𝑧 ∣ ⊤})
3	1, 2	bitr4i 277	1 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑦 𝑦 = 𝐴)

Syntax hints:   ↔ wb 205   = wceq 1539  ⊤wtru 1540  ∃wex 1783   ∈ wcel 2108  {cab 2715

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  ax-7 2012  ax-8 2110

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-clel 2817

This theorem is referenced by:  bj-issettru  34984  bj-issetwt  34986  bj-elissetALT  34988  bj-vtoclg1f1  35029