Theorem bj-opelrelex 38257

Description: The coordinates of an ordered pair that belongs to a relation are sets. TODO: Slightly shorter than brrelex12 5707, which could be proved from it. The first antecedent would not be needed if using df-bj-2upl 38102, by bj-2uplex 38113. (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 5662	. . . 4 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V))
2	1	biimpi 219	. . 3 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V))
3	2	sselda 3913	. 2 ⊢ ((Rel 𝑅 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → ⟨𝐴, 𝐵⟩ ∈ (V × V))
4		opelxp 5691	. 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 2147  Vcvv 3454   ⊆ wss 3900  ⟨cop 4838   × cxp 5653  Rel wrel 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-opab 5171  df-xp 5661  df-rel 5662

This theorem is used by: (None)