Metamath Proof Explorer


Theorem relpropg

Description: A pair of ordered pairs is a relation. (Contributed by Eric Schmidt, 24-Oct-2026)

Ref Expression
Assertion relpropg ⊢ A ∈ V ∧ B ∈ W ∧ C ∈ X ∧ D ∈ Y → Rel ⁡ A B C D

Proof

Step Hyp Ref Expression
1 relsnopg ⊢ A ∈ V ∧ B ∈ W → Rel ⁡ A B
2 relsnopg ⊢ C ∈ X ∧ D ∈ Y → Rel ⁡ C D
3 1 2 anim12i ⊢ A ∈ V ∧ B ∈ W ∧ C ∈ X ∧ D ∈ Y → Rel ⁡ A B ∧ Rel ⁡ C D
4 relun ⊢ Rel ⁡ A B ∪ C D ↔ Rel ⁡ A B ∧ Rel ⁡ C D
5 3 4 sylibr ⊢ A ∈ V ∧ B ∈ W ∧ C ∈ X ∧ D ∈ Y → Rel ⁡ A B ∪ C D
6 df-pr ⊢ A B C D = A B ∪ C D
7 6 releqi ⊢ Rel ⁡ A B C D ↔ Rel ⁡ A B ∪ C D
8 5 7 sylibr ⊢ A ∈ V ∧ B ∈ W ∧ C ∈ X ∧ D ∈ Y → Rel ⁡ A B C D