Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mndpluscn Structured version   Visualization version   GIF version

Theorem mndpluscn 34339
Description: A mapping that is both a homeomorphism and a monoid homomorphism preserves the "continuousness" of the operation. (Contributed by Thierry Arnoux, 25-Mar-2017.)
Hypotheses
Ref Expression
mndpluscn.f 𝐹 ∈ (𝐽Homeo𝐾)
mndpluscn.p + :(𝐵 × 𝐵)⟶𝐵
mndpluscn.t :(𝐶 × 𝐶)⟶𝐶
mndpluscn.j 𝐽 ∈ (TopOn‘𝐵)
mndpluscn.k 𝐾 ∈ (TopOn‘𝐶)
mndpluscn.h ((𝑥𝐵𝑦𝐵) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
mndpluscn.o + ∈ ((𝐽 ×t 𝐽) Cn 𝐽)
Assertion
Ref Expression
mndpluscn ∈ ((𝐾 ×t 𝐾) Cn 𝐾)
Distinct variable groups:   𝑦, ,𝑥   𝑦, +   𝑦,𝐹   𝑥, +   𝑥,𝐵,𝑦   𝑥,𝐹
Allowed substitution hints:   𝐶(𝑥, 𝑦)   𝐽(𝑥, 𝑦)   𝐾(𝑥, 𝑦)

Proof of Theorem mndpluscn
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mndpluscn.t . . . 4 :(𝐶 × 𝐶)⟶𝐶
2 ffn 6709 . . . 4 ( :(𝐶 × 𝐶)⟶𝐶 Fn (𝐶 × 𝐶))
3 fnov 7547 . . . . 5 ( Fn (𝐶 × 𝐶) ↔ = (𝑎𝐶, 𝑏𝐶 ↦ (𝑎 𝑏)))
43biimpi 219 . . . 4 ( Fn (𝐶 × 𝐶) → = (𝑎𝐶, 𝑏𝐶 ↦ (𝑎 𝑏)))
51, 2, 4mp2b 10 . . 3 = (𝑎𝐶, 𝑏𝐶 ↦ (𝑎 𝑏))
6 mndpluscn.f . . . . . . . . 9 𝐹 ∈ (𝐽Homeo𝐾)
7 mndpluscn.j . . . . . . . . . . 11 𝐽 ∈ (TopOn‘𝐵)
87toponunii 23102 . . . . . . . . . 10 𝐵 = 𝐽
9 mndpluscn.k . . . . . . . . . . 11 𝐾 ∈ (TopOn‘𝐶)
109toponunii 23102 . . . . . . . . . 10 𝐶 = 𝐾
118, 10hmeof1o 23950 . . . . . . . . 9 (𝐹 ∈ (𝐽Homeo𝐾) → 𝐹:𝐵1-1-onto𝐶)
126, 11ax-mp 5 . . . . . . . 8 𝐹:𝐵1-1-onto𝐶
13 f1ocnvdm 7289 . . . . . . . 8 ((𝐹:𝐵1-1-onto𝐶𝑎𝐶) → (𝐹𝑎) ∈ 𝐵)
1412, 13mpan 703 . . . . . . 7 (𝑎𝐶 → (𝐹𝑎) ∈ 𝐵)
15 f1ocnvdm 7289 . . . . . . . 8 ((𝐹:𝐵1-1-onto𝐶𝑏𝐶) → (𝐹𝑏) ∈ 𝐵)
1612, 15mpan 703 . . . . . . 7 (𝑏𝐶 → (𝐹𝑏) ∈ 𝐵)
1714, 16anim12i 625 . . . . . 6 ((𝑎𝐶𝑏𝐶) → ((𝐹𝑎) ∈ 𝐵 ∧ (𝐹𝑏) ∈ 𝐵))
18 mndpluscn.h . . . . . . 7 ((𝑥𝐵𝑦𝐵) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)))
1918rgen2 3207 . . . . . 6 𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦))
20 fvoveq1 7439 . . . . . . . 8 (𝑥 = (𝐹𝑎) → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘((𝐹𝑎) + 𝑦)))
21 fveq2 6885 . . . . . . . . 9 (𝑥 = (𝐹𝑎) → (𝐹𝑥) = (𝐹‘(𝐹𝑎)))
2221oveq1d 7431 . . . . . . . 8 (𝑥 = (𝐹𝑎) → ((𝐹𝑥) (𝐹𝑦)) = ((𝐹‘(𝐹𝑎)) (𝐹𝑦)))
2320, 22eqeq12d 2781 . . . . . . 7 (𝑥 = (𝐹𝑎) → ((𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦)) ↔ (𝐹‘((𝐹𝑎) + 𝑦)) = ((𝐹‘(𝐹𝑎)) (𝐹𝑦))))
24 oveq2 7424 . . . . . . . . 9 (𝑦 = (𝐹𝑏) → ((𝐹𝑎) + 𝑦) = ((𝐹𝑎) + (𝐹𝑏)))
2524fveq2d 6889 . . . . . . . 8 (𝑦 = (𝐹𝑏) → (𝐹‘((𝐹𝑎) + 𝑦)) = (𝐹‘((𝐹𝑎) + (𝐹𝑏))))
26 fveq2 6885 . . . . . . . . 9 (𝑦 = (𝐹𝑏) → (𝐹𝑦) = (𝐹‘(𝐹𝑏)))
2726oveq2d 7432 . . . . . . . 8 (𝑦 = (𝐹𝑏) → ((𝐹‘(𝐹𝑎)) (𝐹𝑦)) = ((𝐹‘(𝐹𝑎)) (𝐹‘(𝐹𝑏))))
2825, 27eqeq12d 2781 . . . . . . 7 (𝑦 = (𝐹𝑏) → ((𝐹‘((𝐹𝑎) + 𝑦)) = ((𝐹‘(𝐹𝑎)) (𝐹𝑦)) ↔ (𝐹‘((𝐹𝑎) + (𝐹𝑏))) = ((𝐹‘(𝐹𝑎)) (𝐹‘(𝐹𝑏)))))
2923, 28rspc2va 3595 . . . . . 6 ((((𝐹𝑎) ∈ 𝐵 ∧ (𝐹𝑏) ∈ 𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹𝑥) (𝐹𝑦))) → (𝐹‘((𝐹𝑎) + (𝐹𝑏))) = ((𝐹‘(𝐹𝑎)) (𝐹‘(𝐹𝑏))))
3017, 19, 29sylancl 598 . . . . 5 ((𝑎𝐶𝑏𝐶) → (𝐹‘((𝐹𝑎) + (𝐹𝑏))) = ((𝐹‘(𝐹𝑎)) (𝐹‘(𝐹𝑏))))
31 f1ocnvfv2 7281 . . . . . . 7 ((𝐹:𝐵1-1-onto𝐶𝑎𝐶) → (𝐹‘(𝐹𝑎)) = 𝑎)
3212, 31mpan 703 . . . . . 6 (𝑎𝐶 → (𝐹‘(𝐹𝑎)) = 𝑎)
33 f1ocnvfv2 7281 . . . . . . 7 ((𝐹:𝐵1-1-onto𝐶𝑏𝐶) → (𝐹‘(𝐹𝑏)) = 𝑏)
3412, 33mpan 703 . . . . . 6 (𝑏𝐶 → (𝐹‘(𝐹𝑏)) = 𝑏)
3532, 34oveqan12d 7435 . . . . 5 ((𝑎𝐶𝑏𝐶) → ((𝐹‘(𝐹𝑎)) (𝐹‘(𝐹𝑏))) = (𝑎 𝑏))
3630, 35eqtr2d 2801 . . . 4 ((𝑎𝐶𝑏𝐶) → (𝑎 𝑏) = (𝐹‘((𝐹𝑎) + (𝐹𝑏))))
3736mpoeq3ia 7494 . . 3 (𝑎𝐶, 𝑏𝐶 ↦ (𝑎 𝑏)) = (𝑎𝐶, 𝑏𝐶 ↦ (𝐹‘((𝐹𝑎) + (𝐹𝑏))))
385, 37eqtri 2788 . 2 = (𝑎𝐶, 𝑏𝐶 ↦ (𝐹‘((𝐹𝑎) + (𝐹𝑏))))
399a1i 11 . . . 4 (⊤ → 𝐾 ∈ (TopOn‘𝐶))
4039, 39cnmpt1st 23854 . . . . . 6 (⊤ → (𝑎𝐶, 𝑏𝐶𝑎) ∈ ((𝐾 ×t 𝐾) Cn 𝐾))
41 hmeocnvcn 23947 . . . . . . 7 (𝐹 ∈ (𝐽Homeo𝐾) → 𝐹 ∈ (𝐾 Cn 𝐽))
426, 41mp1i 14 . . . . . 6 (⊤ → 𝐹 ∈ (𝐾 Cn 𝐽))
4339, 39, 40, 42cnmpt21f 23858 . . . . 5 (⊤ → (𝑎𝐶, 𝑏𝐶 ↦ (𝐹𝑎)) ∈ ((𝐾 ×t 𝐾) Cn 𝐽))
4439, 39cnmpt2nd 23855 . . . . . 6 (⊤ → (𝑎𝐶, 𝑏𝐶𝑏) ∈ ((𝐾 ×t 𝐾) Cn 𝐾))
4539, 39, 44, 42cnmpt21f 23858 . . . . 5 (⊤ → (𝑎𝐶, 𝑏𝐶 ↦ (𝐹𝑏)) ∈ ((𝐾 ×t 𝐾) Cn 𝐽))
46 mndpluscn.o . . . . . 6 + ∈ ((𝐽 ×t 𝐽) Cn 𝐽)
4746a1i 11 . . . . 5 (⊤ → + ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
4839, 39, 43, 45, 47cnmpt22f 23861 . . . 4 (⊤ → (𝑎𝐶, 𝑏𝐶 ↦ ((𝐹𝑎) + (𝐹𝑏))) ∈ ((𝐾 ×t 𝐾) Cn 𝐽))
49 hmeocn 23946 . . . . 5 (𝐹 ∈ (𝐽Homeo𝐾) → 𝐹 ∈ (𝐽 Cn 𝐾))
506, 49mp1i 14 . . . 4 (⊤ → 𝐹 ∈ (𝐽 Cn 𝐾))
5139, 39, 48, 50cnmpt21f 23858 . . 3 (⊤ → (𝑎𝐶, 𝑏𝐶 ↦ (𝐹‘((𝐹𝑎) + (𝐹𝑏)))) ∈ ((𝐾 ×t 𝐾) Cn 𝐾))
5251mptru 1577 . 2 (𝑎𝐶, 𝑏𝐶 ↦ (𝐹‘((𝐹𝑎) + (𝐹𝑏)))) ∈ ((𝐾 ×t 𝐾) Cn 𝐾)
5338, 52eqeltri 2861 1 ∈ ((𝐾 ×t 𝐾) Cn 𝐾)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wtru 1571  wcel 2146  wral 3081   × cxp 5661  ccnv 5662   Fn wfn 6535  wf 6536  1-1-ontowf1o 6539  cfv 6540  (class class class)co 7416  cmpo 7418  TopOnctopon 23096   Cn ccn 23410   ×t ctx 23746  Homeochmeo 23939
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-map 8828  df-topgen 17513  df-top 23080  df-topon 23097  df-bases 23132  df-cn 23413  df-tx 23748  df-hmeo 23941
This theorem is used by:  mhmhmeotmd  34340  xrge0pluscn  34353
  Copyright terms: Public domain W3C validator