Metamath Proof Explorer


Theorem bj-inxpALT

Description: Alternate proof of inxp not depending on df-rel . The main proof inxp is shorter because it benefits from the efficient machinery developed for relations: one shows that a class is a relation using theorems like relxp , relinxp , relin1 , relres , and then uses the generic properties of relations, in particular ordered-pair extensionality eqrelriiv . This illustrates the fact that the definitions of Cartesian product df-xp , restriction df-res , and relation df-rel are closely intertwined. Note however that one could use a variant of eqrelriiv not using the Rel predicate, as in bj-ssrel . (Contributed by BJ, 24-Oct-2026) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion bj-inxpALT ⊢ A × B ∩ C × D = A ∩ C × B ∩ D

Proof

Step Hyp Ref Expression
1 eleq1 ⊢ z = x y → z ∈ A × B ∩ C × D ↔ x y ∈ A × B ∩ C × D
2 elin ⊢ x y ∈ A × B ∩ C × D ↔ x y ∈ A × B ∧ x y ∈ C × D
3 1 2 bitrdi ⊢ z = x y → z ∈ A × B ∩ C × D ↔ x y ∈ A × B ∧ x y ∈ C × D
4 an4 ⊢ x ∈ A ∧ x ∈ C ∧ y ∈ B ∧ y ∈ D ↔ x ∈ A ∧ y ∈ B ∧ x ∈ C ∧ y ∈ D
5 elin ⊢ x ∈ A ∩ C ↔ x ∈ A ∧ x ∈ C
6 elin ⊢ y ∈ B ∩ D ↔ y ∈ B ∧ y ∈ D
7 5 6 anbi12i ⊢ x ∈ A ∩ C ∧ y ∈ B ∩ D ↔ x ∈ A ∧ x ∈ C ∧ y ∈ B ∧ y ∈ D
8 opelxp ⊢ x y ∈ A × B ↔ x ∈ A ∧ y ∈ B
9 opelxp ⊢ x y ∈ C × D ↔ x ∈ C ∧ y ∈ D
10 8 9 anbi12i ⊢ x y ∈ A × B ∧ x y ∈ C × D ↔ x ∈ A ∧ y ∈ B ∧ x ∈ C ∧ y ∈ D
11 4 7 10 3bitr4ri ⊢ x y ∈ A × B ∧ x y ∈ C × D ↔ x ∈ A ∩ C ∧ y ∈ B ∩ D
12 3 11 bitrdi ⊢ z = x y → z ∈ A × B ∩ C × D ↔ x ∈ A ∩ C ∧ y ∈ B ∩ D
13 12 copsex2gb ⊢ ∃ x ∃ y z = x y ∧ x ∈ A ∩ C ∧ y ∈ B ∩ D ↔ z ∈ V × V ∧ z ∈ A × B ∩ C × D
14 elxp ⊢ z ∈ A ∩ C × B ∩ D ↔ ∃ x ∃ y z = x y ∧ x ∈ A ∩ C ∧ y ∈ B ∩ D
15 xpss ⊢ A × B ⊆ V × V
16 elinel1 ⊢ z ∈ A × B ∩ C × D → z ∈ A × B
17 15 16 sselid ⊢ z ∈ A × B ∩ C × D → z ∈ V × V
18 17 pm4.71ri ⊢ z ∈ A × B ∩ C × D ↔ z ∈ V × V ∧ z ∈ A × B ∩ C × D
19 13 14 18 3bitr4ri ⊢ z ∈ A × B ∩ C × D ↔ z ∈ A ∩ C × B ∩ D
20 19 eqriv ⊢ A × B ∩ C × D = A ∩ C × B ∩ D