Metamath Proof Explorer


Theorem copsex2gd

Description: Implicit substitution inference for ordered pairs. (Contributed by NM, 28-May-1995) Use a similar proof to copsex4g to reduce axiom usage. (Revised by SN, 1-Sep-2024) Adapt copsex2g $p to deduction form. (Revised by BJ, 28-Mar-2026) Do not use copsex2g . (Proof modification is discouraged.)

Ref Expression
Hypothesis copsex2gd.is ⊢ φ ∧ x = A ∧ y = B → ψ ↔ χ
Assertion copsex2gd ⊢ φ ∧ A ∈ V ∧ B ∈ W → ∃ x ∃ y A B = x y ∧ ψ ↔ χ

Proof

Step Hyp Ref Expression
1 copsex2gd.is ⊢ φ ∧ x = A ∧ y = B → ψ ↔ χ
2 eqcom ⊢ A B = x y ↔ x y = A B
3 vex ⊢ x ∈ V
4 vex ⊢ y ∈ V
5 3 4 opth ⊢ x y = A B ↔ x = A ∧ y = B
6 2 5 bitri ⊢ A B = x y ↔ x = A ∧ y = B
7 6 anbi1i ⊢ A B = x y ∧ ψ ↔ x = A ∧ y = B ∧ ψ
8 7 2exbii ⊢ ∃ x ∃ y A B = x y ∧ ψ ↔ ∃ x ∃ y x = A ∧ y = B ∧ ψ
9 simpr ⊢ φ ∧ x = A ∧ y = B → x = A ∧ y = B
10 9 1 cgsex2gd ⊢ φ ∧ A ∈ V ∧ B ∈ W → ∃ x ∃ y x = A ∧ y = B ∧ ψ ↔ χ
11 8 10 bitrid ⊢ φ ∧ A ∈ V ∧ B ∈ W → ∃ x ∃ y A B = x y ∧ ψ ↔ χ