Theorem bj-opelrelex 38108

Description: The coordinates of an ordered pair that belongs to a relation are sets. TODO: Slightly shorter than brrelex12 5702, which could be proved from it. The first antecedent would not be needed if using df-bj-2upl 37966, by bj-2uplex 37977. (Contributed by BJ, 27-Dec-2023.)

Assertion

Ref	Expression
bj-opelrelex	⊢ ((Rel 𝑅 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Proof of Theorem bj-opelrelex

Step	Hyp	Ref	Expression
1		df-rel 5657	. . . 4 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V))
2	1	biimpi 219	. . 3 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V))
3	2	sselda 3908	. 2 ⊢ ((Rel 𝑅 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → ⟨𝐴, 𝐵⟩ ∈ (V × V))
4		opelxp 5686	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ (V × V) ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
5	3, 4	sylib 221	1 ⊢ ((Rel 𝑅 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895  ⟨cop 4589   × cxp 5648  Rel wrel 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-opab 5167  df-xp 5656  df-rel 5657

This theorem is used by: (None)