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 ( ( 𝐴𝑉𝐴 ≠ ∅ ) → ∅ ∈ ( 𝐴t 𝐴 ) )

Proof

Step Hyp Ref Expression
1 zfreg ( ( 𝐴𝑉𝐴 ≠ ∅ ) → ∃ 𝑥𝐴 ( 𝑥𝐴 ) = ∅ )
2 eqcom ( ( 𝑥𝐴 ) = ∅ ↔ ∅ = ( 𝑥𝐴 ) )
3 2 rexbii ( ∃ 𝑥𝐴 ( 𝑥𝐴 ) = ∅ ↔ ∃ 𝑥𝐴 ∅ = ( 𝑥𝐴 ) )
4 1 3 sylib ( ( 𝐴𝑉𝐴 ≠ ∅ ) → ∃ 𝑥𝐴 ∅ = ( 𝑥𝐴 ) )
5 simpl ( ( 𝐴𝑉𝐴 ≠ ∅ ) → 𝐴𝑉 )
6 elrest ( ( 𝐴𝑉𝐴𝑉 ) → ( ∅ ∈ ( 𝐴t 𝐴 ) ↔ ∃ 𝑥𝐴 ∅ = ( 𝑥𝐴 ) ) )
7 5 6 syldan ( ( 𝐴𝑉𝐴 ≠ ∅ ) → ( ∅ ∈ ( 𝐴t 𝐴 ) ↔ ∃ 𝑥𝐴 ∅ = ( 𝑥𝐴 ) ) )
8 4 7 mpbird ( ( 𝐴𝑉𝐴 ≠ ∅ ) → ∅ ∈ ( 𝐴t 𝐴 ) )