Theorem iducn 24247

Description: The identity is uniformly continuous from a uniform structure to itself. Example 1 of [BourbakiTop1] p. II.6. (Contributed by Thierry Arnoux, 16-Nov-2017.)

Assertion

Ref	Expression
iducn	⊢ (𝑈 ∈ (UnifOn‘𝑋) → ( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈))

Proof of Theorem iducn

Dummy variables 𝑠 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1oi 6819	. . 3 ⊢ ( I ↾ 𝑋):𝑋–1-1-onto→𝑋
2		f1of 6781	. . 3 ⊢ (( I ↾ 𝑋):𝑋–1-1-onto→𝑋 → ( I ↾ 𝑋):𝑋⟶𝑋)
3	1, 2	mp1i 13	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ( I ↾ 𝑋):𝑋⟶𝑋)
4		simpr 484	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) → 𝑠 ∈ 𝑈)
5		fvresi 7128	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → (( I ↾ 𝑋)‘𝑥) = 𝑥)
6		fvresi 7128	. . . . . . . 8 ⊢ (𝑦 ∈ 𝑋 → (( I ↾ 𝑋)‘𝑦) = 𝑦)
7	5, 6	breqan12d 5102	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ((( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦) ↔ 𝑥𝑠𝑦))
8	7	biimprd 248	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
9	8	adantl 481	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
10	9	ralrimivva 3181	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
11		breq 5088	. . . . . . 7 ⊢ (𝑟 = 𝑠 → (𝑥𝑟𝑦 ↔ 𝑥𝑠𝑦))
12	11	imbi1d 341	. . . . . 6 ⊢ (𝑟 = 𝑠 → ((𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)) ↔ (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦))))
13	12	2ralbidv 3202	. . . . 5 ⊢ (𝑟 = 𝑠 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦))))
14	13	rspcev 3565	. . . 4 ⊢ ((𝑠 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦))) → ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
15	4, 10, 14	syl2anc 585	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) → ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
16	15	ralrimiva 3130	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑠 ∈ 𝑈 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
17		isucn 24242	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑈 ∈ (UnifOn‘𝑋)) → (( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈) ↔ (( I ↾ 𝑋):𝑋⟶𝑋 ∧ ∀𝑠 ∈ 𝑈 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))))
18	17	anidms 566	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈) ↔ (( I ↾ 𝑋):𝑋⟶𝑋 ∧ ∀𝑠 ∈ 𝑈 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))))
19	3, 16, 18	mpbir2and 714	1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   class class class wbr 5086   I cid 5525   ↾ cres 5633  ⟶wf 6495  –1-1-onto→wf1o 6498  ‘cfv 6499  (class class class)co 7367  UnifOncust 24165   Cn_ucucn 24239

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-oprab 7371  df-mpo 7372  df-map 8775  df-ust 24166  df-ucn 24240

This theorem is referenced by: (None)