Metamath Proof Explorer


Theorem xpstopnlem2

Description: Lemma for xpstopn . (Contributed by Mario Carneiro, 27-Aug-2015)

Ref Expression
Hypotheses xpstps.t T = R × 𝑠 S
xpstopn.j J = TopOpen R
xpstopn.k K = TopOpen S
xpstopn.o O = TopOpen T
xpstopnlem.x X = Base R
xpstopnlem.y Y = Base S
xpstopnlem.f F = x X , y Y x 1 𝑜 y
Assertion xpstopnlem2 R TopSp S TopSp O = J × t K

Proof

Step Hyp Ref Expression
1 xpstps.t T = R × 𝑠 S
2 xpstopn.j J = TopOpen R
3 xpstopn.k K = TopOpen S
4 xpstopn.o O = TopOpen T
5 xpstopnlem.x X = Base R
6 xpstopnlem.y Y = Base S
7 xpstopnlem.f F = x X , y Y x 1 𝑜 y
8 eqid Scalar R 𝑠 R 1 𝑜 S = Scalar R 𝑠 R 1 𝑜 S
9 fvexd R TopSp S TopSp Scalar R V
10 2on 2 𝑜 On
11 10 a1i R TopSp S TopSp 2 𝑜 On
12 fnpr2o R TopSp S TopSp R 1 𝑜 S Fn 2 𝑜
13 eqid TopOpen Scalar R 𝑠 R 1 𝑜 S = TopOpen Scalar R 𝑠 R 1 𝑜 S
14 8 9 11 12 13 prdstopn R TopSp S TopSp TopOpen Scalar R 𝑠 R 1 𝑜 S = 𝑡 TopOpen R 1 𝑜 S
15 topnfn TopOpen Fn V
16 dffn2 R 1 𝑜 S Fn 2 𝑜 R 1 𝑜 S : 2 𝑜 V
17 12 16 sylib R TopSp S TopSp R 1 𝑜 S : 2 𝑜 V
18 fnfco TopOpen Fn V R 1 𝑜 S : 2 𝑜 V TopOpen R 1 𝑜 S Fn 2 𝑜
19 15 17 18 sylancr R TopSp S TopSp TopOpen R 1 𝑜 S Fn 2 𝑜
20 xpsfeq TopOpen R 1 𝑜 S Fn 2 𝑜 TopOpen R 1 𝑜 S 1 𝑜 TopOpen R 1 𝑜 S 1 𝑜 = TopOpen R 1 𝑜 S
21 19 20 syl R TopSp S TopSp TopOpen R 1 𝑜 S 1 𝑜 TopOpen R 1 𝑜 S 1 𝑜 = TopOpen R 1 𝑜 S
22 0ex V
23 22 prid1 1 𝑜
24 df2o3 2 𝑜 = 1 𝑜
25 23 24 eleqtrri 2 𝑜
26 fvco2 R 1 𝑜 S Fn 2 𝑜 2 𝑜 TopOpen R 1 𝑜 S = TopOpen R 1 𝑜 S
27 12 25 26 sylancl R TopSp S TopSp TopOpen R 1 𝑜 S = TopOpen R 1 𝑜 S
28 fvpr0o R TopSp R 1 𝑜 S = R
29 28 adantr R TopSp S TopSp R 1 𝑜 S = R
30 29 fveq2d R TopSp S TopSp TopOpen R 1 𝑜 S = TopOpen R
31 30 2 eqtr4di R TopSp S TopSp TopOpen R 1 𝑜 S = J
32 27 31 eqtrd R TopSp S TopSp TopOpen R 1 𝑜 S = J
33 32 opeq2d R TopSp S TopSp TopOpen R 1 𝑜 S = J
34 1oelpr 1 𝑜 1 𝑜
35 34 24 eleqtrri 1 𝑜 2 𝑜
36 fvco2 R 1 𝑜 S Fn 2 𝑜 1 𝑜 2 𝑜 TopOpen R 1 𝑜 S 1 𝑜 = TopOpen R 1 𝑜 S 1 𝑜
37 12 35 36 sylancl R TopSp S TopSp TopOpen R 1 𝑜 S 1 𝑜 = TopOpen R 1 𝑜 S 1 𝑜
38 fvpr1o S TopSp R 1 𝑜 S 1 𝑜 = S
39 38 adantl R TopSp S TopSp R 1 𝑜 S 1 𝑜 = S
40 39 fveq2d R TopSp S TopSp TopOpen R 1 𝑜 S 1 𝑜 = TopOpen S
41 40 3 eqtr4di R TopSp S TopSp TopOpen R 1 𝑜 S 1 𝑜 = K
42 37 41 eqtrd R TopSp S TopSp TopOpen R 1 𝑜 S 1 𝑜 = K
43 42 opeq2d R TopSp S TopSp 1 𝑜 TopOpen R 1 𝑜 S 1 𝑜 = 1 𝑜 K
44 33 43 preq12d R TopSp S TopSp TopOpen R 1 𝑜 S 1 𝑜 TopOpen R 1 𝑜 S 1 𝑜 = J 1 𝑜 K
45 21 44 eqtr3d R TopSp S TopSp TopOpen R 1 𝑜 S = J 1 𝑜 K
46 45 fveq2d R TopSp S TopSp 𝑡 TopOpen R 1 𝑜 S = 𝑡 J 1 𝑜 K
47 14 46 eqtrd R TopSp S TopSp TopOpen Scalar R 𝑠 R 1 𝑜 S = 𝑡 J 1 𝑜 K
48 47 oveq1d R TopSp S TopSp TopOpen Scalar R 𝑠 R 1 𝑜 S qTop F -1 = 𝑡 J 1 𝑜 K qTop F -1
49 simpl R TopSp S TopSp R TopSp
50 simpr R TopSp S TopSp S TopSp
51 eqid Scalar R = Scalar R
52 1 5 6 49 50 7 51 8 xpsval R TopSp S TopSp T = F -1 𝑠 Scalar R 𝑠 R 1 𝑜 S
53 1 5 6 49 50 7 51 8 xpsrnbas R TopSp S TopSp ran F = Base Scalar R 𝑠 R 1 𝑜 S
54 7 xpsff1o2 F : X × Y 1-1 onto ran F
55 f1ocnv F : X × Y 1-1 onto ran F F -1 : ran F 1-1 onto X × Y
56 54 55 mp1i R TopSp S TopSp F -1 : ran F 1-1 onto X × Y
57 f1ofo F -1 : ran F 1-1 onto X × Y F -1 : ran F onto X × Y
58 56 57 syl R TopSp S TopSp F -1 : ran F onto X × Y
59 ovexd R TopSp S TopSp Scalar R 𝑠 R 1 𝑜 S V
60 52 53 58 59 13 4 imastopn R TopSp S TopSp O = TopOpen Scalar R 𝑠 R 1 𝑜 S qTop F -1
61 5 2 istps R TopSp J TopOn X
62 49 61 sylib R TopSp S TopSp J TopOn X
63 6 3 istps S TopSp K TopOn Y
64 50 63 sylib R TopSp S TopSp K TopOn Y
65 7 62 64 xpstopnlem1 R TopSp S TopSp F J × t K Homeo 𝑡 J 1 𝑜 K
66 hmeocnv F J × t K Homeo 𝑡 J 1 𝑜 K F -1 𝑡 J 1 𝑜 K Homeo J × t K
67 hmeoqtop F -1 𝑡 J 1 𝑜 K Homeo J × t K J × t K = 𝑡 J 1 𝑜 K qTop F -1
68 65 66 67 3syl R TopSp S TopSp J × t K = 𝑡 J 1 𝑜 K qTop F -1
69 48 60 68 3eqtr4d R TopSp S TopSp O = J × t K