Theorem ussval 24447

Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6877 to avoid requiring 𝑊 to be a set. (Contributed by Thierry Arnoux, 3-Dec-2017.)

Hypotheses

Ref	Expression
ussval.1	⊢ 𝐵 = (Base‘𝑊)
ussval.2	⊢ 𝑈 = (UnifSet‘𝑊)

Assertion

Ref	Expression
ussval	⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)

Proof of Theorem ussval

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ussval.2	. . . 4 ⊢ 𝑈 = (UnifSet‘𝑊)
2		ussval.1	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
3	2, 2	xpeq12i 5691	. . . 4 ⊢ (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
4	1, 3	oveq12i 7428	. . 3 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5		fveq2 6885	. . . . 5 ⊢ (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6		fveq2 6885	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7	6	sqxpeqd 5695	. . . . 5 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
8	5, 7	oveq12d 7434	. . . 4 ⊢ (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9		df-uss 24444	. . . 4 ⊢ UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10		ovex 7449	. . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
11	8, 9, 10	fvmpt 6993	. . 3 ⊢ (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
12	4, 11	eqtr4id 2819	. 2 ⊢ (𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13		0rest 17500	. . 3 ⊢ (∅ ↾t (𝐵 × 𝐵)) = ∅
14		fvprc 6877	. . . . 5 ⊢ (¬ 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
15	1, 14	eqtrid 2812	. . . 4 ⊢ (¬ 𝑊 ∈ V → 𝑈 = ∅)
16	15	oveq1d 7431	. . 3 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17		fvprc 6877	. . 3 ⊢ (¬ 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
18	13, 16, 17	3eqtr4a 2826	. 2 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
19	12, 18	pm2.61i 184	1 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ∅c0 4286   × cxp 5661  ‘cfv 6540  (class class class)co 7416  Basecbs 17287  UnifSetcunif 17338   ↾_t crest 17491  UnifStcuss 24441

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-rest 17493  df-uss 24444

This theorem is used by:  ussid  24448  ressuss  24450