Theorem zfreg 9664

Description: The Axiom of Regularity using abbreviations. Axiom 6 of [TakeutiZaring] p. 21. This is called the "weak form". Axiom Reg of [BellMachover] p. 480. There is also a "strong form", not requiring that 𝐴 be a set, that can be proved with more difficulty (see zfregs 9801). (Contributed by NM, 26-Nov-1995.) Replace sethood hypothesis with sethood antecedent. (Revised by BJ, 27-Apr-2021.)

Assertion

Ref	Expression
zfreg	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem zfreg

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0 4376	. . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
2	1	biimpi 216	. . 3 ⊢ (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴)
3	2	anim2i 616	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → (𝐴 ∈ 𝑉 ∧ ∃𝑥 𝑥 ∈ 𝐴))
4		zfregcl 9663	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴))
5	4	imp 406	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∃𝑥 𝑥 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴)
6		disj 4473	. . . 4 ⊢ ((𝑥 ∩ 𝐴) = ∅ ↔ ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴)
7	6	rexbii 3100	. . 3 ⊢ (∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅ ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴)
8	7	biimpri 228	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅)
9	3, 5, 8	3syl 18	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  ∃wrex 3076   ∩ cin 3975  ∅c0 4352

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2178  ax-ext 2711  ax-reg 9661

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-dif 3979  df-in 3983  df-nul 4353

This theorem is referenced by:  zfregfr  9674  en3lp  9683  inf3lem3  9699  bj-restreg  37065  setindtr  42981