Theorem ussval 24633

Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6908 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 5686	. . . 4 ⊢ (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
4	1, 3	oveq12i 7463	. . 3 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5		fveq2 6916	. . . . 5 ⊢ (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6		fveq2 6916	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7	6	sqxpeqd 5690	. . . . 5 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
8	5, 7	oveq12d 7469	. . . 4 ⊢ (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9		df-uss 24630	. . . 4 ⊢ UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10		ovex 7484	. . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
11	8, 9, 10	fvmpt 7024	. . 3 ⊢ (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
12	4, 11	eqtr4id 2817	. 2 ⊢ (𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13		0rest 17650	. . 3 ⊢ (∅ ↾t (𝐵 × 𝐵)) = ∅
14		fvprc 6908	. . . . 5 ⊢ (¬ 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
15	1, 14	eqtrid 2810	. . . 4 ⊢ (¬ 𝑊 ∈ V → 𝑈 = ∅)
16	15	oveq1d 7466	. . 3 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17		fvprc 6908	. . 3 ⊢ (¬ 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
18	13, 16, 17	3eqtr4a 2824	. 2 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
19	12, 18	pm2.61i 184	1 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281   × cxp 5656  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  UnifSetcunif 17482   ↾_t crest 17641  UnifStcuss 24627

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 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-rest 17643  df-uss 24630

This theorem is used by:  ussid  24634  ressuss  24636