metnrm - Metamath Proof Explorer

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

Theorem metnrm 23472

Description: A metric space is normal. (Contributed by Jeff Hankins, 31-Aug-2013.) (Revised by Mario Carneiro, 5-Sep-2015.) (Proof shortened by AV, 30-Sep-2020.)

**Hypothesis**
Ref	Expression
metnrm.j	⊢ 𝐽 = (MetOpen‘𝐷)

**Assertion**
Ref	Expression
metnrm	⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Nrm)

Proof of Theorem metnrm Dummy variables 𝑡 𝑠 𝑢 𝑣 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		metnrm.j	. . 3 ⊢ 𝐽 = (MetOpen‘𝐷)
2	1	mopntop 23052	. 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Top)
3		eqid 2823	. . . . 5 ⊢ (𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑥 ↦ (𝑢𝐷𝑣)), ℝ^, < )) = (𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑥 ↦ (𝑢𝐷𝑣)), ℝ^, < ))
4		simp1 1132	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑦 ∈ (Clsd‘𝐽)) ∧ (𝑥 ∩ 𝑦) = ∅) → 𝐷 ∈ (∞Met‘𝑋))
5		simp2l 1195	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑦 ∈ (Clsd‘𝐽)) ∧ (𝑥 ∩ 𝑦) = ∅) → 𝑥 ∈ (Clsd‘𝐽))
6		simp2r 1196	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑦 ∈ (Clsd‘𝐽)) ∧ (𝑥 ∩ 𝑦) = ∅) → 𝑦 ∈ (Clsd‘𝐽))
7		simp3 1134	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑦 ∈ (Clsd‘𝐽)) ∧ (𝑥 ∩ 𝑦) = ∅) → (𝑥 ∩ 𝑦) = ∅)
8		eqid 2823	. . . . 5 ⊢ ∪ 𝑠 ∈ 𝑦 (𝑠(ball‘𝐷)(if(1 ≤ ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑥 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑠), 1, ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑥 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑠)) / 2)) = ∪ 𝑠 ∈ 𝑦 (𝑠(ball‘𝐷)(if(1 ≤ ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑥 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑠), 1, ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑥 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑠)) / 2))
9		eqid 2823	. . . . 5 ⊢ (𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑦 ↦ (𝑢𝐷𝑣)), ℝ^, < )) = (𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑦 ↦ (𝑢𝐷𝑣)), ℝ^, < ))
10		eqid 2823	. . . . 5 ⊢ ∪ 𝑡 ∈ 𝑥 (𝑡(ball‘𝐷)(if(1 ≤ ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑦 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑡), 1, ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑦 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑡)) / 2)) = ∪ 𝑡 ∈ 𝑥 (𝑡(ball‘𝐷)(if(1 ≤ ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑦 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑡), 1, ((𝑢 ∈ 𝑋 ↦ inf(ran (𝑣 ∈ 𝑦 ↦ (𝑢𝐷𝑣)), ℝ^, < ))‘𝑡)) / 2))
11	3, 1, 4, 5, 6, 7, 8, 9, 10	metnrmlem3 23471	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑦 ∈ (Clsd‘𝐽)) ∧ (𝑥 ∩ 𝑦) = ∅) → ∃𝑧 ∈ 𝐽 ∃𝑤 ∈ 𝐽 (𝑥 ⊆ 𝑧 ∧ 𝑦 ⊆ 𝑤 ∧ (𝑧 ∩ 𝑤) = ∅))
12	11	3expia 1117	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑥 ∈ (Clsd‘𝐽) ∧ 𝑦 ∈ (Clsd‘𝐽))) → ((𝑥 ∩ 𝑦) = ∅ → ∃𝑧 ∈ 𝐽 ∃𝑤 ∈ 𝐽 (𝑥 ⊆ 𝑧 ∧ 𝑦 ⊆ 𝑤 ∧ (𝑧 ∩ 𝑤) = ∅)))
13	12	ralrimivva 3193	. 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ (Clsd‘𝐽)∀𝑦 ∈ (Clsd‘𝐽)((𝑥 ∩ 𝑦) = ∅ → ∃𝑧 ∈ 𝐽 ∃𝑤 ∈ 𝐽 (𝑥 ⊆ 𝑧 ∧ 𝑦 ⊆ 𝑤 ∧ (𝑧 ∩ 𝑤) = ∅)))
14		isnrm3 21969	. 2 ⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ (Clsd‘𝐽)∀𝑦 ∈ (Clsd‘𝐽)((𝑥 ∩ 𝑦) = ∅ → ∃𝑧 ∈ 𝐽 ∃𝑤 ∈ 𝐽 (𝑥 ⊆ 𝑧 ∧ 𝑦 ⊆ 𝑤 ∧ (𝑧 ∩ 𝑤) = ∅))))
15	2, 13, 14	sylanbrc 585	1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Nrm)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ∃wrex 3141 ∩ cin 3937 ⊆ wss 3938 ∅c0 4293 ifcif 4469 ∪ ciun 4921 class class class wbr 5068 ↦ cmpt 5148 ran crn 5558 ‘cfv 6357 (class class class)co 7158 infcinf 8907 1c1 10540 ℝ^*cxr 10676 < clt 10677 ≤ cle 10678 / cdiv 11299 2c2 11695 ∞Metcxmet 20532 ballcbl 20534 MetOpencmopn 20537 Topctop 21503 Clsdccld 21626 Nrmcnrm 21920

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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-ec 8293 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-sup 8908 df-inf 8909 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-n0 11901 df-z 11985 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-icc 12748 df-topgen 16719 df-psmet 20539 df-xmet 20540 df-bl 20542 df-mopn 20543 df-top 21504 df-topon 21521 df-bases 21556 df-cld 21629 df-ntr 21630 df-cls 21631 df-nrm 21927

This theorem is referenced by: metreg 23473

W3C validator