Theorem sprval 48766

Description: The set of all unordered pairs over a given set 𝑉. (Contributed by AV, 21-Nov-2021.)

Assertion

Ref	Expression
sprval	⊢ (𝑉 ∈ 𝑊 → (Pairs‘𝑉) = {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}})

Distinct variable groups:   𝑉,𝑎,𝑏,𝑝   𝑊,𝑎,𝑏,𝑝

Proof of Theorem sprval

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-spr 48765	. . 3 ⊢ Pairs = (𝑣 ∈ V ↦ {𝑝 ∣ ∃𝑎 ∈ 𝑣 ∃𝑏 ∈ 𝑣 𝑝 = {𝑎, 𝑏}})
2	1	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → Pairs = (𝑣 ∈ V ↦ {𝑝 ∣ ∃𝑎 ∈ 𝑣 ∃𝑏 ∈ 𝑣 𝑝 = {𝑎, 𝑏}}))
3		id 23	. . . . 5 ⊢ (𝑣 = 𝑉 → 𝑣 = 𝑉)
4		rexeq 3319	. . . . 5 ⊢ (𝑣 = 𝑉 → (∃𝑏 ∈ 𝑣 𝑝 = {𝑎, 𝑏} ↔ ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}))
5	3, 4	rexeqbidv 3339	. . . 4 ⊢ (𝑣 = 𝑉 → (∃𝑎 ∈ 𝑣 ∃𝑏 ∈ 𝑣 𝑝 = {𝑎, 𝑏} ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}))
6	5	adantl 487	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 = 𝑉) → (∃𝑎 ∈ 𝑣 ∃𝑏 ∈ 𝑣 𝑝 = {𝑎, 𝑏} ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}))
7	6	abbidv 2829	. 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 = 𝑉) → {𝑝 ∣ ∃𝑎 ∈ 𝑣 ∃𝑏 ∈ 𝑣 𝑝 = {𝑎, 𝑏}} = {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}})
8		elex 3475	. 2 ⊢ (𝑉 ∈ 𝑊 → 𝑉 ∈ V)
9		zfpair2 5396	. . . . . . . 8 ⊢ {𝑎, 𝑏} ∈ V
10		eueq 3669	. . . . . . . 8 ⊢ ({𝑎, 𝑏} ∈ V ↔ ∃!𝑝 𝑝 = {𝑎, 𝑏})
11	9, 10	mpbi 233	. . . . . . 7 ⊢ ∃!𝑝 𝑝 = {𝑎, 𝑏}
12		euabex 5433	. . . . . . 7 ⊢ (∃!𝑝 𝑝 = {𝑎, 𝑏} → {𝑝 ∣ 𝑝 = {𝑎, 𝑏}} ∈ V)
13	11, 12	mp1i 14	. . . . . 6 ⊢ (𝑉 ∈ 𝑊 → {𝑝 ∣ 𝑝 = {𝑎, 𝑏}} ∈ V)
14	13	ralrimivw 3162	. . . . 5 ⊢ (𝑉 ∈ 𝑊 → ∀𝑏 ∈ 𝑉 {𝑝 ∣ 𝑝 = {𝑎, 𝑏}} ∈ V)
15		abrexex2g 8000	. . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ ∀𝑏 ∈ 𝑉 {𝑝 ∣ 𝑝 = {𝑎, 𝑏}} ∈ V) → {𝑝 ∣ ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ∈ V)
16	14, 15	mpdan 700	. . . 4 ⊢ (𝑉 ∈ 𝑊 → {𝑝 ∣ ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ∈ V)
17	16	ralrimivw 3162	. . 3 ⊢ (𝑉 ∈ 𝑊 → ∀𝑎 ∈ 𝑉 {𝑝 ∣ ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ∈ V)
18		abrexex2g 8000	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ ∀𝑎 ∈ 𝑉 {𝑝 ∣ ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ∈ V) → {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ∈ V)
19	17, 18	mpdan 700	. 2 ⊢ (𝑉 ∈ 𝑊 → {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}} ∈ V)
20	2, 7, 8, 19	fvmptd 7024	1 ⊢ (𝑉 ∈ 𝑊 → (Pairs‘𝑉) = {𝑝 ∣ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 𝑝 = {𝑎, 𝑏}})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃!weu 2596  {cab 2741  ∀wral 3080  ∃wrex 3090  Vcvv 3454  {cpr 4590   ↦ cmpt 5189  ‘cfv 6558  Pairscspr 48764

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-pr 5395  ax-un 7775

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-spr 48765

This theorem is used by:  sprvalpw  48767  sprssspr  48768  prprspr2  48805