Theorem bj-denotesALTV 37540

Description: Moved to main as iseqsetv-clel 2844 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 2070, and eqeq1 2769, requires the core axioms and { ax-9 2156, ax-ext 2737, df-cleq 2757 } whereas this proof requires the core axioms and { ax-8 2148, df-clab 2744, df-clel 2840 }.

Theorem bj-issetwt 37543 proves that "existing" is equivalent to being a member of a class abstraction. It also requires, with the present proof, { ax-8 2148, df-clab 2744, df-clel 2840 } (whereas with the shorter proof from cbvexvw 2070 and eqeq1 2769 it would require { ax-8 2148, ax-9 2156, ax-ext 2737, df-clab 2744, df-cleq 2757, df-clel 2840 }). That every class is equal to a class abstraction is proved by abid1 2901, which requires { ax-8 2148, ax-9 2156, ax-ext 2737, df-clab 2744, df-cleq 2757, df-clel 2840 }.

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

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

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

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

Proof of Theorem bj-denotesALTV

Dummy variable 𝑧 is distinct from all other variables.

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

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  ⊤wtru 1571  ∃wex 1812   ∈ wcel 2146  {cab 2743

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 2148

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-clel 2840

This theorem is used by: (None)