ustbas2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ustbas2		Structured version Visualization version GIF version

Theorem ustbas2 24169

Description: Second direction for ustbas 24171. (Contributed by Thierry Arnoux, 16-Nov-2017.)

**Assertion**
Ref	Expression
ustbas2	⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 = dom ∪ 𝑈)

Proof of Theorem ustbas2 Dummy variables 𝑤 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmxpid 5879	. 2 ⊢ dom (𝑋 × 𝑋) = 𝑋
2		ustbasel 24151	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) ∈ 𝑈)
3		elssuni 4894	. . . . 5 ⊢ ((𝑋 × 𝑋) ∈ 𝑈 → (𝑋 × 𝑋) ⊆ ∪ 𝑈)
4	2, 3	syl 17	. . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) ⊆ ∪ 𝑈)
5		elfvex 6869	. . . . . . . . 9 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
6		isust 24148	. . . . . . . . 9 ⊢ (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ^◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
7	5, 6	syl 17	. . . . . . . 8 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ^◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
8	7	ibi 267	. . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ^◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣))))
9	8	simp1d 1142	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ⊆ 𝒫 (𝑋 × 𝑋))
10	9	unissd 4873	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∪ 𝑈 ⊆ ∪ 𝒫 (𝑋 × 𝑋))
11		unipw 5398	. . . . 5 ⊢ ∪ 𝒫 (𝑋 × 𝑋) = (𝑋 × 𝑋)
12	10, 11	sseqtrdi 3974	. . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∪ 𝑈 ⊆ (𝑋 × 𝑋))
13	4, 12	eqssd 3951	. . 3 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) = ∪ 𝑈)
14	13	dmeqd 5854	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → dom (𝑋 × 𝑋) = dom ∪ 𝑈)
15	1, 14	eqtr3id 2785	1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 = dom ∪ 𝑈)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 Vcvv 3440 ∩ cin 3900 ⊆ wss 3901 𝒫 cpw 4554 ∪ cuni 4863 I cid 5518 × cxp 5622 ^◡ccnv 5623 dom cdm 5624 ↾ cres 5626 ∘ ccom 5628 ‘cfv 6492 UnifOncust 24144

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-res 5636 df-iota 6448 df-fun 6494 df-fv 6500 df-ust 24145

This theorem is referenced by: ustbas 24171 utopval 24176 tuslem 24210 ucnval 24220 iscfilu 24231

W3C validator