Theorem txsconn 35235

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 35221	. . 3 ⊢ (𝑅 ∈ SConn → 𝑅 ∈ PConn)
2		sconnpconn 35221	. . 3 ⊢ (𝑆 ∈ SConn → 𝑆 ∈ PConn)
3		txpconn 35226	. . 3 ⊢ ((𝑅 ∈ PConn ∧ 𝑆 ∈ PConn) → (𝑅 ×t 𝑆) ∈ PConn)
4	1, 2, 3	syl2an 596	. 2 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ PConn)
5		simpll 766	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ SConn)
6		simprl 770	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓 ∈ (II Cn (𝑅 ×t 𝑆)))
7		sconntop 35222	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ SConn → 𝑅 ∈ Top)
8	7	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ Top)
9		eqid 2730	. . . . . . . . . . . . 13 ⊢ ∪ 𝑅 = ∪ 𝑅
10	9	toptopon 22811	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘∪ 𝑅))
11	8, 10	sylib 218	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑅 ∈ (TopOn‘∪ 𝑅))
12		sconntop 35222	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ SConn → 𝑆 ∈ Top)
13	12	ad2antlr 727	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ Top)
14		eqid 2730	. . . . . . . . . . . . 13 ⊢ ∪ 𝑆 = ∪ 𝑆
15	14	toptopon 22811	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘∪ 𝑆))
16	13, 15	sylib 218	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ (TopOn‘∪ 𝑆))
17		tx1cn 23503	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
18	11, 16, 17	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
19		cnco 23160	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅))
20	6, 18, 19	syl2anc 584	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅))
21		simprr 772	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (𝑓‘0) = (𝑓‘1))
22	21	fveq2d 6865	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
23		iitopon 24779	. . . . . . . . . . . . 13 ⊢ II ∈ (TopOn‘(0[,]1))
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → II ∈ (TopOn‘(0[,]1)))
25		txtopon 23485	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
26	11, 16, 25	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)))
27		cnf2 23143	. . . . . . . . . . . 12 ⊢ ((II ∈ (TopOn‘(0[,]1)) ∧ (𝑅 ×t 𝑆) ∈ (TopOn‘(∪ 𝑅 × ∪ 𝑆)) ∧ 𝑓 ∈ (II Cn (𝑅 ×t 𝑆))) → 𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆))
28	24, 26, 6, 27	syl3anc 1373	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆))
29		0elunit 13437	. . . . . . . . . . 11 ⊢ 0 ∈ (0[,]1)
30		fvco3 6963	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 0 ∈ (0[,]1)) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
31	28, 29, 30	sylancl 586	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
32		1elunit 13438	. . . . . . . . . . 11 ⊢ 1 ∈ (0[,]1)
33		fvco3 6963	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 1 ∈ (0[,]1)) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
34	28, 32, 33	sylancl 586	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
35	22, 31, 34	3eqtr4d 2775	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1))
36		sconnpht 35223	. . . . . . . . 9 ⊢ ((𝑅 ∈ SConn ∧ ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑅) ∧ (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1)) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
37	5, 20, 35, 36	syl3anc 1373	. . . . . . . 8 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
38		isphtpc 24900	. . . . . . . 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 1144	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑅)((0[,]1) × {(((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅)
41		n0 4319	. . . . . 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 768	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → 𝑆 ∈ SConn)
44		tx2cn 23504	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ (TopOn‘∪ 𝑅) ∧ 𝑆 ∈ (TopOn‘∪ 𝑆)) → (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
45	11, 16, 44	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
46		cnco 23160	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆))
47	6, 45, 46	syl2anc 584	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆))
48	21	fveq2d 6865	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
49		fvco3 6963	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 0 ∈ (0[,]1)) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
50	28, 29, 49	sylancl 586	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘0)))
51		fvco3 6963	. . . . . . . . . . 11 ⊢ ((𝑓:(0[,]1)⟶(∪ 𝑅 × ∪ 𝑆) ∧ 1 ∈ (0[,]1)) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
52	28, 32, 51	sylancl 586	. . . . . . . . . 10 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆))‘(𝑓‘1)))
53	48, 50, 52	3eqtr4d 2775	. . . . . . . . 9 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1))
54		sconnpht 35223	. . . . . . . . 9 ⊢ ((𝑆 ∈ SConn ∧ ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) ∈ (II Cn 𝑆) ∧ (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0) = (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘1)) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
55	43, 47, 53, 54	syl3anc 1373	. . . . . . . 8 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)( ≃ph‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)}))
56		isphtpc 24900	. . . . . . . 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 1144	. . . . . 6 ⊢ (((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) ∧ (𝑓 ∈ (II Cn (𝑅 ×t 𝑆)) ∧ (𝑓‘0) = (𝑓‘1))) → (((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)(PHtpy‘𝑆)((0[,]1) × {(((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)‘0)})) ≠ ∅)
59		n0 4319	. . . . . 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 1955	. . . . . 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 2730	. . . . . . . . 9 ⊢ ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) = ((1st ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)
66		eqid 2730	. . . . . . . . 9 ⊢ ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓) = ((2nd ↾ (∪ 𝑅 × ∪ 𝑆)) ∘ 𝑓)
67		simprl 770	. . . . . . . . 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 772	. . . . . . . . 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 35234	. . . . . . . 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 1934	. . . . . 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 699	. . . 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 3126	. 2 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → ∀𝑓 ∈ (II Cn (𝑅 ×t 𝑆))((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)})))
76		issconn 35220	. 2 ⊢ ((𝑅 ×t 𝑆) ∈ SConn ↔ ((𝑅 ×t 𝑆) ∈ PConn ∧ ∀𝑓 ∈ (II Cn (𝑅 ×t 𝑆))((𝑓‘0) = (𝑓‘1) → 𝑓( ≃ph‘(𝑅 ×t 𝑆))((0[,]1) × {(𝑓‘0)}))))
77	4, 75, 76	sylanbrc 583	1 ⊢ ((𝑅 ∈ SConn ∧ 𝑆 ∈ SConn) → (𝑅 ×t 𝑆) ∈ SConn)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109   ≠ wne 2926  ∀wral 3045  ∅c0 4299  {csn 4592  ∪ cuni 4874   class class class wbr 5110   × cxp 5639   ↾ cres 5643   ∘ ccom 5645  ⟶wf 6510  ‘cfv 6514  (class class class)co 7390  1^st c1st 7969  2^nd c2nd 7970  0cc0 11075  1c1 11076  [,]cicc 13316  Topctop 22787  TopOnctopon 22804   Cn ccn 23118   ×_t ctx 23454  IIcii 24775  PHtpycphtpy 24874   ≃_phcphtpc 24875  PConncpconn 35213  SConncsconn 35214

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152  ax-pre-sup 11153

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-er 8674  df-map 8804  df-en 8922  df-dom 8923  df-sdom 8924  df-sup 9400  df-inf 9401  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-div 11843  df-nn 12194  df-2 12256  df-3 12257  df-n0 12450  df-z 12537  df-uz 12801  df-q 12915  df-rp 12959  df-xneg 13079  df-xadd 13080  df-xmul 13081  df-icc 13320  df-seq 13974  df-exp 14034  df-cj 15072  df-re 15073  df-im 15074  df-sqrt 15208  df-abs 15209  df-topgen 17413  df-psmet 21263  df-xmet 21264  df-met 21265  df-bl 21266  df-mopn 21267  df-top 22788  df-topon 22805  df-bases 22840  df-cn 23121  df-cnp 23122  df-tx 23456  df-ii 24777  df-htpy 24876  df-phtpy 24877  df-phtpc 24898  df-pconn 35215  df-sconn 35216

This theorem is referenced by: (None)