Theorem txsconn 35420

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 35406	. . 3 ⊢ (𝑅 ∈ SConn → 𝑅 ∈ PConn)
2		sconnpconn 35406	. . 3 ⊢ (𝑆 ∈ SConn → 𝑆 ∈ PConn)
3		txpconn 35411	. . 3 ⊢ ((𝑅 ∈ PConn ∧ 𝑆 ∈ PConn) → (𝑅 ×t 𝑆) ∈ PConn)
4	1, 2, 3	syl2an 597	. 2 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ PConn)
5		simpll 767	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ SConn)
6		simprl 771	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓 ∈ (II Cn (𝑅 ×t 𝑆)))
7		sconntop 35407	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ SConn → 𝑅 ∈ Top)
8	7	ad2antrr 727	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ Top)
9		eqid 2737	. . . . . . . . . . . . 13 ⊢ ∪ 𝑅 = ∪ 𝑅
10	9	toptopon 22879	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘∪ 𝑅))
11	8, 10	sylib 218	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ (TopOn‘∪ 𝑅))
12		sconntop 35407	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ SConn → 𝑆 ∈ Top)
13	12	ad2antlr 728	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ Top)
14		eqid 2737	. . . . . . . . . . . . 13 ⊢ ∪ 𝑆 = ∪ 𝑆
15	14	toptopon 22879	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘∪ 𝑆))
16	13, 15	sylib 218	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ (TopOn‘∪ 𝑆))
17		tx1cn 23571	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
18	11, 16, 17	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
19		cnco 23228	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅))
20	6, 18, 19	syl2anc 585	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅))
21		simprr 773	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (𝑓‘0) = (𝑓‘1))
22	21	fveq2d 6842	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
23		iitopon 24843	. . . . . . . . . . . . 13 ⊢ II ∈ (TopOn‘(0[,]1))
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → II ∈ (TopOn‘(0[,]1)))
25		txtopon 23553	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
26	11, 16, 25	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
27		cnf2 23211	. . . . . . . . . . . 12 ⊢ ((II ∈ (TopOn‘(0[,]1)) ∧ (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)) ∧ 𝑓 ∈ (II Cn (𝑅 ×t 𝑆))) → 𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆))
28	24, 26, 6, 27	syl3anc 1374	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆))
29		0elunit 13419	. . . . . . . . . . 11 ⊢ 0 ∈ (0[,]1)
30		fvco3 6937	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 0 ∈ (0[,]1)) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
31	28, 29, 30	sylancl 587	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
32		1elunit 13420	. . . . . . . . . . 11 ⊢ 1 ∈ (0[,]1)
33		fvco3 6937	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 1 ∈ (0[,]1)) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
34	28, 32, 33	sylancl 587	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
35	22, 31, 34	3eqtr4d 2782	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1))
36		sconnpht 35408	. . . . . . . . 9 ⊢ ((𝑅 ∈ SConn ∧ ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅) ∧ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1)) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
37	5, 20, 35, 36	syl3anc 1374	. . . . . . . 8 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
38		isphtpc 24958	. . . . . . . 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 218	. . . . . . 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 1145	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅)
41		n0 4294	. . . . . 6 ⊢ ((((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅ ↔ ∃𝑔 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
42	40, 41	sylib 218	. . . . 5 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ∃𝑔 𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
43		simplr 769	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ SConn)
44		tx2cn 23572	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
45	11, 16, 44	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
46		cnco 23228	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆))
47	6, 45, 46	syl2anc 585	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆))
48	21	fveq2d 6842	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
49		fvco3 6937	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 0 ∈ (0[,]1)) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
50	28, 29, 49	sylancl 587	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
51		fvco3 6937	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 1 ∈ (0[,]1)) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
52	28, 32, 51	sylancl 587	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
53	48, 50, 52	3eqtr4d 2782	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1))
54		sconnpht 35408	. . . . . . . . 9 ⊢ ((𝑆 ∈ SConn ∧ ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆) ∧ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1)) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
55	43, 47, 53, 54	syl3anc 1374	. . . . . . . 8 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
56		isphtpc 24958	. . . . . . . 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 218	. . . . . . 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 1145	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅)
59		n0 4294	. . . . . 6 ⊢ ((((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅ ↔ ∃ℎ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
60	58, 59	sylib 218	. . . . 5 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ∃ℎ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))
61		exdistrv 1957	. . . . . 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 480	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑅 ∈ Top)
63	13	adantr 480	. . . . . . . . 9 ⊢ ((((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) ∧ (𝑔 ∈ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ∧ ℎ ∈ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})))) → 𝑆 ∈ Top)
64	6	adantr 480	. . . . . . . . 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 2737	. . . . . . . . 9 ⊢ ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)
66		eqid 2737	. . . . . . . . 9 ⊢ ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)
67		simprl 771	. . . . . . . . 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 773	. . . . . . . . 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 35419	. . . . . . . 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 412	. . . . . . 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 1936	. . . . . 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 243	. . . . 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 700	. . . 4 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)}))
74	73	expr 456	. . 3 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ 𝑓 ∈ (II Cn (𝑅 ×t 𝑆))) → ((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
75	74	ralrimiva 3130	. 2 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → ∀𝑓 ∈ (II Cn (𝑅 ×t 𝑆))((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
76		issconn 35405	. 2 ⊢ ((𝑅 ×t 𝑆) ∈ SConn ↔ ((𝑅 ×t 𝑆) ∈ PConn ∧ ∀𝑓 ∈ (II Cn (𝑅 ×t 𝑆))((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)}))))
77	4, 75, 76	sylanbrc 584	1 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ SConn)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∅c0 4274  {csn 4568  ∪ cuni 4851   class class class wbr 5086   × cxp 5626   ↾ cres 5630   ∘ ccom 5632  ⟶wf 6492  ‘cfv 6496  (class class class)co 7364  1^st c1st 7937  2^nd c2nd 7938  0cc0 11035  1c1 11036  [,]cicc 13298  Topctop 22855  TopOnctopon 22872   Cn ccn 23186   ×_t ctx 23522  IIcii 24839  PHtpycphtpy 24932   ≃_phcphtpc 24933  PConncpconn 35398  SConncsconn 35399

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-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5306  ax-pr 5374  ax-un 7686  ax-cnex 11091  ax-resscn 11092  ax-1cn 11093  ax-icn 11094  ax-addcl 11095  ax-addrcl 11096  ax-mulcl 11097  ax-mulrcl 11098  ax-mulcom 11099  ax-addass 11100  ax-mulass 11101  ax-distr 11102  ax-i2m1 11103  ax-1ne0 11104  ax-1rid 11105  ax-rnegex 11106  ax-rrecex 11107  ax-cnre 11108  ax-pre-lttri 11109  ax-pre-lttrn 11110  ax-pre-ltadd 11111  ax-pre-mulgt0 11112  ax-pre-sup 11113

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  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-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5523  df-eprel 5528  df-po 5536  df-so 5537  df-fr 5581  df-we 5583  df-xp 5634  df-rel 5635  df-cnv 5636  df-co 5637  df-dm 5638  df-rn 5639  df-res 5640  df-ima 5641  df-pred 6263  df-ord 6324  df-on 6325  df-lim 6326  df-suc 6327  df-iota 6452  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7321  df-ov 7367  df-oprab 7368  df-mpo 7369  df-om 7815  df-1st 7939  df-2nd 7940  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-er 8640  df-map 8772  df-en 8891  df-dom 8892  df-sdom 8893  df-sup 9352  df-inf 9353  df-pnf 11178  df-mnf 11179  df-xr 11180  df-ltxr 11181  df-le 11182  df-sub 11376  df-neg 11377  df-div 11805  df-nn 12172  df-2 12241  df-3 12242  df-n0 12435  df-z 12522  df-uz 12786  df-q 12896  df-rp 12940  df-xneg 13060  df-xadd 13061  df-xmul 13062  df-icc 13302  df-seq 13961  df-exp 14021  df-cj 15058  df-re 15059  df-im 15060  df-sqrt 15194  df-abs 15195  df-topgen 17403  df-psmet 21341  df-xmet 21342  df-met 21343  df-bl 21344  df-mopn 21345  df-top 22856  df-topon 22873  df-bases 22908  df-cn 23189  df-cnp 23190  df-tx 23524  df-ii 24841  df-htpy 24934  df-phtpy 24935  df-phtpc 24956  df-pconn 35400  df-sconn 35401

This theorem is referenced by: (None)