Theorem txsconn 36173

Description: The topological product of two simply connected spaces is simply connected. (Contributed by Mario Carneiro, 12-Feb-2015.)

Assertion

Ref	Expression
txsconn	⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ SConn)

Proof of Theorem txsconn

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sconnpconn 36159	. . 3 ⊢ (𝑅 ∈ SConn → 𝑅 ∈ PConn)
2		sconnpconn 36159	. . 3 ⊢ (𝑆 ∈ SConn → 𝑆 ∈ PConn)
3		txpconn 36164	. . 3 ⊢ ((𝑅 ∈ PConn ∧ 𝑆 ∈ PConn) → (𝑅 ×t 𝑆) ∈ PConn)
4	1, 2, 3	syl2an 608	. 2 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ PConn)
5		simpll 779	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ SConn)
6		simprl 783	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓 ∈ (II Cn (𝑅 ×t 𝑆)))
7		sconntop 36160	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ SConn → 𝑅 ∈ Top)
8	7	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ Top)
9		eqid 2763	. . . . . . . . . . . . 13 ⊢ ∪ 𝑅 = ∪ 𝑅
10	9	toptopon 23265	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘∪ 𝑅))
11	8, 10	sylib 221	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ (TopOn‘∪ 𝑅))
12		sconntop 36160	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ SConn → 𝑆 ∈ Top)
13	12	ad2antlr 740	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ Top)
14		eqid 2763	. . . . . . . . . . . . 13 ⊢ ∪ 𝑆 = ∪ 𝑆
15	14	toptopon 23265	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘∪ 𝑆))
16	13, 15	sylib 221	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ (TopOn‘∪ 𝑆))
17		tx1cn 23958	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
18	11, 16, 17	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
19		cnco 23614	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅))
20	6, 18, 19	syl2anc 596	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅))
21		simprr 785	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (𝑓‘0) = (𝑓‘1))
22	21	fveq2d 6912	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
23		iitopon 25230	. . . . . . . . . . . . 13 ⊢ II ∈ (TopOn‘(0[,]1))
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → II ∈ (TopOn‘(0[,]1)))
25		txtopon 23940	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
26	11, 16, 25	syl2anc 596	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
27		cnf2 23597	. . . . . . . . . . . 12 ⊢ ((II ∈ (TopOn‘(0[,]1)) ∧ (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)) ∧ 𝑓 ∈ (II Cn (𝑅 ×t 𝑆))) → 𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆))
28	24, 26, 6, 27	syl3anc 1399	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆))
29		0elunit 13627	. . . . . . . . . . 11 ⊢ 0 ∈ (0[,]1)
30		fvco3 7008	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 0 ∈ (0[,]1)) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
31	28, 29, 30	sylancl 598	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
32		1elunit 13628	. . . . . . . . . . 11 ⊢ 1 ∈ (0[,]1)
33		fvco3 7008	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 1 ∈ (0[,]1)) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
34	28, 32, 33	sylancl 598	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
35	22, 31, 34	3eqtr4d 2808	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1))
36		sconnpht 36161	. . . . . . . . 9 ⊢ ((𝑅 ∈ SConn ∧ ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅) ∧ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1)) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
37	5, 20, 35, 36	syl3anc 1399	. . . . . . . 8 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
38		isphtpc 25345	. . . . . . . 8 ⊢ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}) ↔ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅) ∧ ((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}) ∈ (II Cn 𝑅) ∧ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅))
39	37, 38	sylib 221	. . . . . . 7 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅) ∧ ((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}) ∈ (II Cn 𝑅) ∧ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅))
40	39	simp3d 1162	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅)
41		n0 4303	. . . . . 6 ⊢ ((((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅ ↔ ∃𝑔 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
42	40, 41	sylib 221	. . . . 5 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ∃𝑔 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
43		simplr 781	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ SConn)
44		tx2cn 23959	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
45	11, 16, 44	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
46		cnco 23614	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆))
47	6, 45, 46	syl2anc 596	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆))
48	21	fveq2d 6912	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
49		fvco3 7008	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 0 ∈ (0[,]1)) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
50	28, 29, 49	sylancl 598	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
51		fvco3 7008	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 1 ∈ (0[,]1)) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
52	28, 32, 51	sylancl 598	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
53	48, 50, 52	3eqtr4d 2808	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1))
54		sconnpht 36161	. . . . . . . . 9 ⊢ ((𝑆 ∈ SConn ∧ ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆) ∧ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1)) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
55	43, 47, 53, 54	syl3anc 1399	. . . . . . . 8 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
56		isphtpc 25345	. . . . . . . 8 ⊢ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}) ↔ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆) ∧ ((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}) ∈ (II Cn 𝑆) ∧ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅))
57	55, 56	sylib 221	. . . . . . 7 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆) ∧ ((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}) ∈ (II Cn 𝑆) ∧ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅))
58	57	simp3d 1162	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅)
59		n0 4303	. . . . . 6 ⊢ ((((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅ ↔ ∃ℎ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
60	58, 59	sylib 221	. . . . 5 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ∃ℎ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
61		exdistrv 1990	. . . . . 6 ⊢ (∃𝑔∃ℎ(𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))) ↔ (∃𝑔 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ∃ℎ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))))
62	8	adantr 486	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑅 ∈ Top)
63	13	adantr 486	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑆 ∈ Top)
64	6	adantr 486	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑓 ∈ (II Cn (𝑅 ×t 𝑆)))
65		eqid 2763	. . . . . . . . 9 ⊢ ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)
66		eqid 2763	. . . . . . . . 9 ⊢ ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)
67		simprl 783	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
68		simprr 785	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
69	62, 63, 64, 65, 66, 67, 68	txsconnlem 36172	. . . . . . . 8 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)}))
70	69	ex 418	. . . . . . 7 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
71	70	exlimdvv 1969	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (∃𝑔∃ℎ(𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
72	61, 71	biimtrrid 246	. . . . 5 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((∃𝑔 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ∃ℎ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
73	42, 60, 72	mp2and 712	. . . 4 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)}))
74	73	expr 462	. . 3 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ 𝑓 ∈ (II Cn (𝑅 ×t 𝑆))) → ((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
75	74	ralrimiva 3158	. 2 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → ∀𝑓 ∈ (II Cn (𝑅 ×t 𝑆))((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
76		issconn 36158	. 2 ⊢ ((𝑅 ×t 𝑆) ∈ SConn ↔ ((𝑅 ×t 𝑆) ∈ PConn ∧ ∀𝑓 ∈ (II Cn (𝑅 ×t 𝑆))((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)}))))
77	4, 75, 76	sylanbrc 595	1 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ SConn)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∅c0 4281  {csn 4588  ∪ cuni 4870   class class class wbr 5106   × cxp 5653   ↾ cres 5657   ∘ ccom 5659  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  1^st c1st 8023  2^nd c2nd 8024  0cc0 11227  1c1 11228  [,]cicc 13506  Topctop 23241  TopOnctopon 23258   Cn ccn 23572   ×_t ctx 23909  IIcii 25226  PHtpycphtpy 25319   ≃_phcphtpc 25320  PConncpconn 36151  SConncsconn 36152

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304  ax-pre-sup 11305

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-er 8745  df-map 8877  df-en 9002  df-dom 9003  df-sdom 9004  df-sup 9461  df-inf 9462  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-div 12001  df-nn 12363  df-2 12432  df-3 12433  df-n0 12634  df-z 12721  df-uz 12993  df-q 13103  df-rp 13148  df-xneg 13268  df-xadd 13269  df-xmul 13270  df-icc 13510  df-seq 14172  df-exp 14232  df-cj 15295  df-re 15296  df-im 15297  df-sqrt 15431  df-abs 15432  df-topgen 17643  df-psmet 21700  df-xmet 21701  df-met 21702  df-bl 21703  df-mopn 21704  df-top 23242  df-topon 23259  df-bases 23294  df-cn 23575  df-cnp 23576  df-tx 23911  df-ii 25228  df-htpy 25321  df-phtpy 25322  df-phtpc 25343  df-pconn 36153  df-sconn 36154

This theorem is used by: (None)