Metamath Proof Explorer


Theorem bj-restreg

Description: A reformulation of the axiom of regularity using elementwise intersection. (RK: might have to be placed later since theorems in this section are to be moved early (in the section related to the algebra of sets).) (Contributed by BJ, 27-Apr-2021)

Ref Expression
Assertion bj-restreg ⊢ A ∈ V ∧ A ≠ ∅ → ∅ ∈ A ↾ 𝑡 A

Proof

Step Hyp Ref Expression
1 zfreg ⊢ A ∈ V ∧ A ≠ ∅ → ∃ x ∈ A x ∩ A = ∅
2 eqcom ⊢ x ∩ A = ∅ ↔ ∅ = x ∩ A
3 2 rexbii ⊢ ∃ x ∈ A x ∩ A = ∅ ↔ ∃ x ∈ A ∅ = x ∩ A
4 1 3 sylib ⊢ A ∈ V ∧ A ≠ ∅ → ∃ x ∈ A ∅ = x ∩ A
5 simpl ⊢ A ∈ V ∧ A ≠ ∅ → A ∈ V
6 elrest ⊢ A ∈ V ∧ A ∈ V → ∅ ∈ A ↾ 𝑡 A ↔ ∃ x ∈ A ∅ = x ∩ A
7 5 6 syldan ⊢ A ∈ V ∧ A ≠ ∅ → ∅ ∈ A ↾ 𝑡 A ↔ ∃ x ∈ A ∅ = x ∩ A
8 4 7 mpbird ⊢ A ∈ V ∧ A ≠ ∅ → ∅ ∈ A ↾ 𝑡 A