Theorem ussval 23411

Description: The uniform structure on uniform space 𝑊. This proof uses a trick with fvprc 6766 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 5617	. . . 4 ⊢ (𝐵 × 𝐵) = ((Base‘𝑊) × (Base‘𝑊))
4	1, 3	oveq12i 7287	. . 3 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊)))
5		fveq2 6774	. . . . 5 ⊢ (𝑤 = 𝑊 → (UnifSet‘𝑤) = (UnifSet‘𝑊))
6		fveq2 6774	. . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7	6	sqxpeqd 5621	. . . . 5 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × (Base‘𝑤)) = ((Base‘𝑊) × (Base‘𝑊)))
8	5, 7	oveq12d 7293	. . . 4 ⊢ (𝑤 = 𝑊 → ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
9		df-uss 23408	. . . 4 ⊢ UnifSt = (𝑤 ∈ V ↦ ((UnifSet‘𝑤) ↾t ((Base‘𝑤) × (Base‘𝑤))))
10		ovex 7308	. . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ∈ V
11	8, 9, 10	fvmpt 6875	. . 3 ⊢ (𝑊 ∈ V → (UnifSt‘𝑊) = ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))))
12	4, 11	eqtr4id 2797	. 2 ⊢ (𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
13		0rest 17140	. . 3 ⊢ (∅ ↾t (𝐵 × 𝐵)) = ∅
14		fvprc 6766	. . . . 5 ⊢ (¬ 𝑊 ∈ V → (UnifSet‘𝑊) = ∅)
15	1, 14	eqtrid 2790	. . . 4 ⊢ (¬ 𝑊 ∈ V → 𝑈 = ∅)
16	15	oveq1d 7290	. . 3 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (∅ ↾t (𝐵 × 𝐵)))
17		fvprc 6766	. . 3 ⊢ (¬ 𝑊 ∈ V → (UnifSt‘𝑊) = ∅)
18	13, 16, 17	3eqtr4a 2804	. 2 ⊢ (¬ 𝑊 ∈ V → (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊))
19	12, 18	pm2.61i 182	1 ⊢ (𝑈 ↾t (𝐵 × 𝐵)) = (UnifSt‘𝑊)

Syntax hints:  ¬ wn 3   = wceq 1539   ∈ wcel 2106  Vcvv 3432  ∅c0 4256   × cxp 5587  ‘cfv 6433  (class class class)co 7275  Basecbs 16912  UnifSetcunif 16972   ↾_t crest 17131  UnifStcuss 23405

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-rest 17133  df-uss 23408

This theorem is referenced by:  ussid  23412  ressuss  23414