Theorem iducn 23435

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 6754	. . 3 ⊢ ( I ↾ 𝑋):𝑋–1-1-onto→𝑋
2		f1of 6716	. . 3 ⊢ (( I ↾ 𝑋):𝑋–1-1-onto→𝑋 → ( I ↾ 𝑋):𝑋⟶𝑋)
3	1, 2	mp1i 13	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ( I ↾ 𝑋):𝑋⟶𝑋)
4		simpr 485	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) → 𝑠 ∈ 𝑈)
5		fvresi 7045	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → (( I ↾ 𝑋)‘𝑥) = 𝑥)
6		fvresi 7045	. . . . . . . 8 ⊢ (𝑦 ∈ 𝑋 → (( I ↾ 𝑋)‘𝑦) = 𝑦)
7	5, 6	breqan12d 5090	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ((( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦) ↔ 𝑥𝑠𝑦))
8	7	biimprd 247	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
9	8	adantl 482	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
10	9	ralrimivva 3123	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
11		breq 5076	. . . . . . 7 ⊢ (𝑟 = 𝑠 → (𝑥𝑟𝑦 ↔ 𝑥𝑠𝑦))
12	11	imbi1d 342	. . . . . 6 ⊢ (𝑟 = 𝑠 → ((𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)) ↔ (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦))))
13	12	2ralbidv 3129	. . . . 5 ⊢ (𝑟 = 𝑠 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦))))
14	13	rspcev 3561	. . . 4 ⊢ ((𝑠 ∈ 𝑈 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑠𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦))) → ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
15	4, 10, 14	syl2anc 584	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑠 ∈ 𝑈) → ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
16	15	ralrimiva 3103	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑠 ∈ 𝑈 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))
17		isucn 23430	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑈 ∈ (UnifOn‘𝑋)) → (( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈) ↔ (( I ↾ 𝑋):𝑋⟶𝑋 ∧ ∀𝑠 ∈ 𝑈 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))))
18	17	anidms 567	. 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈) ↔ (( I ↾ 𝑋):𝑋⟶𝑋 ∧ ∀𝑠 ∈ 𝑈 ∃𝑟 ∈ 𝑈 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑟𝑦 → (( I ↾ 𝑋)‘𝑥)𝑠(( I ↾ 𝑋)‘𝑦)))))
19	3, 16, 18	mpbir2and 710	1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ( I ↾ 𝑋) ∈ (𝑈 Cnu𝑈))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∈ wcel 2106  ∀wral 3064  ∃wrex 3065   class class class wbr 5074   I cid 5488   ↾ cres 5591  ⟶wf 6429  –1-1-onto→wf1o 6432  ‘cfv 6433  (class class class)co 7275  UnifOncust 23351   Cn_ucucn 23427

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-sep 5223  ax-nul 5230  ax-pow 5288  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-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  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-map 8617  df-ust 23352  df-ucn 23428

This theorem is referenced by: (None)