Metamath Proof Explorer


Theorem rmoi

Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 4-Nov-2012) (Revised by NM, 16-Jun-2017)

Ref Expression
Hypotheses rmoi.b ⊢ x = B → φ ↔ ψ
rmoi.c ⊢ x = C → φ ↔ χ
Assertion rmoi ⊢ ∃* x ∈ A φ ∧ B ∈ A ∧ ψ ∧ C ∈ A ∧ χ → B = C

Proof

Step Hyp Ref Expression
1 rmoi.b ⊢ x = B → φ ↔ ψ
2 rmoi.c ⊢ x = C → φ ↔ χ
3 1 2 rmob ⊢ ∃* x ∈ A φ ∧ B ∈ A ∧ ψ → B = C ↔ C ∈ A ∧ χ
4 3 biimp3ar ⊢ ∃* x ∈ A φ ∧ B ∈ A ∧ ψ ∧ C ∈ A ∧ χ → B = C