Theorem prsprel 47361

Description: The elements of a pair from the set of all unordered pairs over a given set 𝑉 are elements of the set 𝑉. (Contributed by AV, 22-Nov-2021.)

Assertion

Ref	Expression
prsprel	⊢ (({𝑋, 𝑌} ∈ (Pairs‘𝑉) ∧ (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊)) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉))

Proof of Theorem prsprel

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sprel 47358	. . 3 ⊢ ({𝑋, 𝑌} ∈ (Pairs‘𝑉) → ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 {𝑋, 𝑌} = {𝑎, 𝑏})
2		preq12bg 4878	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ({𝑋, 𝑌} = {𝑎, 𝑏} ↔ ((𝑋 = 𝑎 ∧ 𝑌 = 𝑏) ∨ (𝑋 = 𝑏 ∧ 𝑌 = 𝑎))))
3		eleq1 2832	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑋 → (𝑎 ∈ 𝑉 ↔ 𝑋 ∈ 𝑉))
4	3	eqcoms 2748	. . . . . . . . . . . 12 ⊢ (𝑋 = 𝑎 → (𝑎 ∈ 𝑉 ↔ 𝑋 ∈ 𝑉))
5		eleq1 2832	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑌 → (𝑏 ∈ 𝑉 ↔ 𝑌 ∈ 𝑉))
6	5	eqcoms 2748	. . . . . . . . . . . 12 ⊢ (𝑌 = 𝑏 → (𝑏 ∈ 𝑉 ↔ 𝑌 ∈ 𝑉))
7	4, 6	bi2anan9 637	. . . . . . . . . . 11 ⊢ ((𝑋 = 𝑎 ∧ 𝑌 = 𝑏) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ↔ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
8	7	biimpd 229	. . . . . . . . . 10 ⊢ ((𝑋 = 𝑎 ∧ 𝑌 = 𝑏) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
9		eleq1 2832	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑋 → (𝑏 ∈ 𝑉 ↔ 𝑋 ∈ 𝑉))
10	9	eqcoms 2748	. . . . . . . . . . . . 13 ⊢ (𝑋 = 𝑏 → (𝑏 ∈ 𝑉 ↔ 𝑋 ∈ 𝑉))
11		eleq1 2832	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑌 → (𝑎 ∈ 𝑉 ↔ 𝑌 ∈ 𝑉))
12	11	eqcoms 2748	. . . . . . . . . . . . 13 ⊢ (𝑌 = 𝑎 → (𝑎 ∈ 𝑉 ↔ 𝑌 ∈ 𝑉))
13	10, 12	bi2anan9 637	. . . . . . . . . . . 12 ⊢ ((𝑋 = 𝑏 ∧ 𝑌 = 𝑎) → ((𝑏 ∈ 𝑉 ∧ 𝑎 ∈ 𝑉) ↔ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
14	13	biimpd 229	. . . . . . . . . . 11 ⊢ ((𝑋 = 𝑏 ∧ 𝑌 = 𝑎) → ((𝑏 ∈ 𝑉 ∧ 𝑎 ∈ 𝑉) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
15	14	ancomsd 465	. . . . . . . . . 10 ⊢ ((𝑋 = 𝑏 ∧ 𝑌 = 𝑎) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
16	8, 15	jaoi 856	. . . . . . . . 9 ⊢ (((𝑋 = 𝑎 ∧ 𝑌 = 𝑏) ∨ (𝑋 = 𝑏 ∧ 𝑌 = 𝑎)) → ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
17	16	com12 32	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (((𝑋 = 𝑎 ∧ 𝑌 = 𝑏) ∨ (𝑋 = 𝑏 ∧ 𝑌 = 𝑎)) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
18	17	adantl 481	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (((𝑋 = 𝑎 ∧ 𝑌 = 𝑏) ∨ (𝑋 = 𝑏 ∧ 𝑌 = 𝑎)) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
19	2, 18	sylbid 240	. . . . . 6 ⊢ (((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ({𝑋, 𝑌} = {𝑎, 𝑏} → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
20	19	expcom 413	. . . . 5 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) → ({𝑋, 𝑌} = {𝑎, 𝑏} → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉))))
21	20	com23 86	. . . 4 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → ({𝑋, 𝑌} = {𝑎, 𝑏} → ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉))))
22	21	rexlimivv 3207	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 {𝑋, 𝑌} = {𝑎, 𝑏} → ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
23	1, 22	syl 17	. 2 ⊢ ({𝑋, 𝑌} ∈ (Pairs‘𝑉) → ((𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)))
24	23	imp 406	1 ⊢ (({𝑋, 𝑌} ∈ (Pairs‘𝑉) ∧ (𝑋 ∈ 𝑈 ∧ 𝑌 ∈ 𝑊)) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846   = wceq 1537   ∈ wcel 2108  ∃wrex 3076  {cpr 4650  ‘cfv 6573  Pairscspr 47351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-spr 47352

This theorem is referenced by:  prsssprel  47362  sprsymrelfolem2  47367