Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnmpt2pc Structured version   Visualization version   GIF version

Theorem cnmpt2pc 22774
 Description: Piecewise definition of a continuous function on a real interval. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 5-Jun-2014.)
Hypotheses
Ref Expression
cnmpt2pc.r 𝑅 = (topGen‘ran (,))
cnmpt2pc.m 𝑀 = (𝑅t (𝐴[,]𝐵))
cnmpt2pc.n 𝑁 = (𝑅t (𝐵[,]𝐶))
cnmpt2pc.o 𝑂 = (𝑅t (𝐴[,]𝐶))
cnmpt2pc.a (𝜑𝐴 ∈ ℝ)
cnmpt2pc.c (𝜑𝐶 ∈ ℝ)
cnmpt2pc.b (𝜑𝐵 ∈ (𝐴[,]𝐶))
cnmpt2pc.j (𝜑𝐽 ∈ (TopOn‘𝑋))
cnmpt2pc.q ((𝜑 ∧ (𝑥 = 𝐵𝑦𝑋)) → 𝐷 = 𝐸)
cnmpt2pc.d (𝜑 → (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋𝐷) ∈ ((𝑀 ×t 𝐽) Cn 𝐾))
cnmpt2pc.e (𝜑 → (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋𝐸) ∈ ((𝑁 ×t 𝐽) Cn 𝐾))
Assertion
Ref Expression
cnmpt2pc (𝜑 → (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ∈ ((𝑂 ×t 𝐽) Cn 𝐾))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐾,𝑦   𝜑,𝑥,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐷(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝐸(𝑥,𝑦)   𝐽(𝑥,𝑦)   𝑀(𝑥,𝑦)   𝑁(𝑥,𝑦)   𝑂(𝑥,𝑦)

Proof of Theorem cnmpt2pc
StepHypRef Expression
1 eqid 2651 . 2 (𝑂 ×t 𝐽) = (𝑂 ×t 𝐽)
2 eqid 2651 . 2 𝐾 = 𝐾
3 cnmpt2pc.a . . . . . 6 (𝜑𝐴 ∈ ℝ)
4 cnmpt2pc.c . . . . . 6 (𝜑𝐶 ∈ ℝ)
5 iccssre 12293 . . . . . 6 ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴[,]𝐶) ⊆ ℝ)
63, 4, 5syl2anc 694 . . . . 5 (𝜑 → (𝐴[,]𝐶) ⊆ ℝ)
7 cnmpt2pc.b . . . . . . . 8 (𝜑𝐵 ∈ (𝐴[,]𝐶))
86, 7sseldd 3637 . . . . . . 7 (𝜑𝐵 ∈ ℝ)
9 icccld 22617 . . . . . . 7 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ∈ (Clsd‘(topGen‘ran (,))))
103, 8, 9syl2anc 694 . . . . . 6 (𝜑 → (𝐴[,]𝐵) ∈ (Clsd‘(topGen‘ran (,))))
11 cnmpt2pc.r . . . . . . 7 𝑅 = (topGen‘ran (,))
1211fveq2i 6232 . . . . . 6 (Clsd‘𝑅) = (Clsd‘(topGen‘ran (,)))
1310, 12syl6eleqr 2741 . . . . 5 (𝜑 → (𝐴[,]𝐵) ∈ (Clsd‘𝑅))
14 ssun1 3809 . . . . . 6 (𝐴[,]𝐵) ⊆ ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))
15 iccsplit 12343 . . . . . . 7 ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐵 ∈ (𝐴[,]𝐶)) → (𝐴[,]𝐶) = ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶)))
163, 4, 7, 15syl3anc 1366 . . . . . 6 (𝜑 → (𝐴[,]𝐶) = ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶)))
1714, 16syl5sseqr 3687 . . . . 5 (𝜑 → (𝐴[,]𝐵) ⊆ (𝐴[,]𝐶))
18 uniretop 22613 . . . . . . 7 ℝ = (topGen‘ran (,))
1911unieqi 4477 . . . . . . 7 𝑅 = (topGen‘ran (,))
2018, 19eqtr4i 2676 . . . . . 6 ℝ = 𝑅
2120restcldi 21025 . . . . 5 (((𝐴[,]𝐶) ⊆ ℝ ∧ (𝐴[,]𝐵) ∈ (Clsd‘𝑅) ∧ (𝐴[,]𝐵) ⊆ (𝐴[,]𝐶)) → (𝐴[,]𝐵) ∈ (Clsd‘(𝑅t (𝐴[,]𝐶))))
226, 13, 17, 21syl3anc 1366 . . . 4 (𝜑 → (𝐴[,]𝐵) ∈ (Clsd‘(𝑅t (𝐴[,]𝐶))))
23 cnmpt2pc.o . . . . 5 𝑂 = (𝑅t (𝐴[,]𝐶))
2423fveq2i 6232 . . . 4 (Clsd‘𝑂) = (Clsd‘(𝑅t (𝐴[,]𝐶)))
2522, 24syl6eleqr 2741 . . 3 (𝜑 → (𝐴[,]𝐵) ∈ (Clsd‘𝑂))
26 cnmpt2pc.j . . . . 5 (𝜑𝐽 ∈ (TopOn‘𝑋))
27 toponuni 20767 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
2826, 27syl 17 . . . 4 (𝜑𝑋 = 𝐽)
29 topontop 20766 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
30 eqid 2651 . . . . . 6 𝐽 = 𝐽
3130topcld 20887 . . . . 5 (𝐽 ∈ Top → 𝐽 ∈ (Clsd‘𝐽))
3226, 29, 313syl 18 . . . 4 (𝜑 𝐽 ∈ (Clsd‘𝐽))
3328, 32eqeltrd 2730 . . 3 (𝜑𝑋 ∈ (Clsd‘𝐽))
34 txcld 21454 . . 3 (((𝐴[,]𝐵) ∈ (Clsd‘𝑂) ∧ 𝑋 ∈ (Clsd‘𝐽)) → ((𝐴[,]𝐵) × 𝑋) ∈ (Clsd‘(𝑂 ×t 𝐽)))
3525, 33, 34syl2anc 694 . 2 (𝜑 → ((𝐴[,]𝐵) × 𝑋) ∈ (Clsd‘(𝑂 ×t 𝐽)))
36 icccld 22617 . . . . . . 7 ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵[,]𝐶) ∈ (Clsd‘(topGen‘ran (,))))
378, 4, 36syl2anc 694 . . . . . 6 (𝜑 → (𝐵[,]𝐶) ∈ (Clsd‘(topGen‘ran (,))))
3837, 12syl6eleqr 2741 . . . . 5 (𝜑 → (𝐵[,]𝐶) ∈ (Clsd‘𝑅))
39 ssun2 3810 . . . . . 6 (𝐵[,]𝐶) ⊆ ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))
4039, 16syl5sseqr 3687 . . . . 5 (𝜑 → (𝐵[,]𝐶) ⊆ (𝐴[,]𝐶))
4120restcldi 21025 . . . . 5 (((𝐴[,]𝐶) ⊆ ℝ ∧ (𝐵[,]𝐶) ∈ (Clsd‘𝑅) ∧ (𝐵[,]𝐶) ⊆ (𝐴[,]𝐶)) → (𝐵[,]𝐶) ∈ (Clsd‘(𝑅t (𝐴[,]𝐶))))
426, 38, 40, 41syl3anc 1366 . . . 4 (𝜑 → (𝐵[,]𝐶) ∈ (Clsd‘(𝑅t (𝐴[,]𝐶))))
4342, 24syl6eleqr 2741 . . 3 (𝜑 → (𝐵[,]𝐶) ∈ (Clsd‘𝑂))
44 txcld 21454 . . 3 (((𝐵[,]𝐶) ∈ (Clsd‘𝑂) ∧ 𝑋 ∈ (Clsd‘𝐽)) → ((𝐵[,]𝐶) × 𝑋) ∈ (Clsd‘(𝑂 ×t 𝐽)))
4543, 33, 44syl2anc 694 . 2 (𝜑 → ((𝐵[,]𝐶) × 𝑋) ∈ (Clsd‘(𝑂 ×t 𝐽)))
4616xpeq1d 5172 . . . 4 (𝜑 → ((𝐴[,]𝐶) × 𝑋) = (((𝐴[,]𝐵) ∪ (𝐵[,]𝐶)) × 𝑋))
47 xpundir 5206 . . . 4 (((𝐴[,]𝐵) ∪ (𝐵[,]𝐶)) × 𝑋) = (((𝐴[,]𝐵) × 𝑋) ∪ ((𝐵[,]𝐶) × 𝑋))
4846, 47syl6eq 2701 . . 3 (𝜑 → ((𝐴[,]𝐶) × 𝑋) = (((𝐴[,]𝐵) × 𝑋) ∪ ((𝐵[,]𝐶) × 𝑋)))
49 retopon 22614 . . . . . . . 8 (topGen‘ran (,)) ∈ (TopOn‘ℝ)
5011, 49eqeltri 2726 . . . . . . 7 𝑅 ∈ (TopOn‘ℝ)
51 resttopon 21013 . . . . . . 7 ((𝑅 ∈ (TopOn‘ℝ) ∧ (𝐴[,]𝐶) ⊆ ℝ) → (𝑅t (𝐴[,]𝐶)) ∈ (TopOn‘(𝐴[,]𝐶)))
5250, 6, 51sylancr 696 . . . . . 6 (𝜑 → (𝑅t (𝐴[,]𝐶)) ∈ (TopOn‘(𝐴[,]𝐶)))
5323, 52syl5eqel 2734 . . . . 5 (𝜑𝑂 ∈ (TopOn‘(𝐴[,]𝐶)))
54 txtopon 21442 . . . . 5 ((𝑂 ∈ (TopOn‘(𝐴[,]𝐶)) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑂 ×t 𝐽) ∈ (TopOn‘((𝐴[,]𝐶) × 𝑋)))
5553, 26, 54syl2anc 694 . . . 4 (𝜑 → (𝑂 ×t 𝐽) ∈ (TopOn‘((𝐴[,]𝐶) × 𝑋)))
56 toponuni 20767 . . . 4 ((𝑂 ×t 𝐽) ∈ (TopOn‘((𝐴[,]𝐶) × 𝑋)) → ((𝐴[,]𝐶) × 𝑋) = (𝑂 ×t 𝐽))
5755, 56syl 17 . . 3 (𝜑 → ((𝐴[,]𝐶) × 𝑋) = (𝑂 ×t 𝐽))
5848, 57eqtr3d 2687 . 2 (𝜑 → (((𝐴[,]𝐵) × 𝑋) ∪ ((𝐵[,]𝐶) × 𝑋)) = (𝑂 ×t 𝐽))
59 cnmpt2pc.m . . . . . . . . . 10 𝑀 = (𝑅t (𝐴[,]𝐵))
6017, 6sstrd 3646 . . . . . . . . . . 11 (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
61 resttopon 21013 . . . . . . . . . . 11 ((𝑅 ∈ (TopOn‘ℝ) ∧ (𝐴[,]𝐵) ⊆ ℝ) → (𝑅t (𝐴[,]𝐵)) ∈ (TopOn‘(𝐴[,]𝐵)))
6250, 60, 61sylancr 696 . . . . . . . . . 10 (𝜑 → (𝑅t (𝐴[,]𝐵)) ∈ (TopOn‘(𝐴[,]𝐵)))
6359, 62syl5eqel 2734 . . . . . . . . 9 (𝜑𝑀 ∈ (TopOn‘(𝐴[,]𝐵)))
64 txtopon 21442 . . . . . . . . 9 ((𝑀 ∈ (TopOn‘(𝐴[,]𝐵)) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑀 ×t 𝐽) ∈ (TopOn‘((𝐴[,]𝐵) × 𝑋)))
6563, 26, 64syl2anc 694 . . . . . . . 8 (𝜑 → (𝑀 ×t 𝐽) ∈ (TopOn‘((𝐴[,]𝐵) × 𝑋)))
66 cnmpt2pc.d . . . . . . . . . 10 (𝜑 → (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋𝐷) ∈ ((𝑀 ×t 𝐽) Cn 𝐾))
67 cntop2 21093 . . . . . . . . . 10 ((𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋𝐷) ∈ ((𝑀 ×t 𝐽) Cn 𝐾) → 𝐾 ∈ Top)
6866, 67syl 17 . . . . . . . . 9 (𝜑𝐾 ∈ Top)
692toptopon 20770 . . . . . . . . 9 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
7068, 69sylib 208 . . . . . . . 8 (𝜑𝐾 ∈ (TopOn‘ 𝐾))
71 elicc2 12276 . . . . . . . . . . . . . . 15 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴[,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴𝑥𝑥𝐵)))
723, 8, 71syl2anc 694 . . . . . . . . . . . . . 14 (𝜑 → (𝑥 ∈ (𝐴[,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴𝑥𝑥𝐵)))
7372biimpa 500 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝐴[,]𝐵)) → (𝑥 ∈ ℝ ∧ 𝐴𝑥𝑥𝐵))
7473simp3d 1095 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝐴[,]𝐵)) → 𝑥𝐵)
75743adant3 1101 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦𝑋) → 𝑥𝐵)
7675iftrued 4127 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝐴[,]𝐵) ∧ 𝑦𝑋) → if(𝑥𝐵, 𝐷, 𝐸) = 𝐷)
7776mpt2eq3dva 6761 . . . . . . . . 9 (𝜑 → (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) = (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋𝐷))
7877, 66eqeltrd 2730 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ∈ ((𝑀 ×t 𝐽) Cn 𝐾))
79 cnf2 21101 . . . . . . . 8 (((𝑀 ×t 𝐽) ∈ (TopOn‘((𝐴[,]𝐵) × 𝑋)) ∧ 𝐾 ∈ (TopOn‘ 𝐾) ∧ (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ∈ ((𝑀 ×t 𝐽) Cn 𝐾)) → (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐴[,]𝐵) × 𝑋)⟶ 𝐾)
8065, 70, 78, 79syl3anc 1366 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐴[,]𝐵) × 𝑋)⟶ 𝐾)
81 eqid 2651 . . . . . . . 8 (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) = (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸))
8281fmpt2 7282 . . . . . . 7 (∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾 ↔ (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐴[,]𝐵) × 𝑋)⟶ 𝐾)
8380, 82sylibr 224 . . . . . 6 (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾)
84 cnmpt2pc.n . . . . . . . . . 10 𝑁 = (𝑅t (𝐵[,]𝐶))
8540, 6sstrd 3646 . . . . . . . . . . 11 (𝜑 → (𝐵[,]𝐶) ⊆ ℝ)
86 resttopon 21013 . . . . . . . . . . 11 ((𝑅 ∈ (TopOn‘ℝ) ∧ (𝐵[,]𝐶) ⊆ ℝ) → (𝑅t (𝐵[,]𝐶)) ∈ (TopOn‘(𝐵[,]𝐶)))
8750, 85, 86sylancr 696 . . . . . . . . . 10 (𝜑 → (𝑅t (𝐵[,]𝐶)) ∈ (TopOn‘(𝐵[,]𝐶)))
8884, 87syl5eqel 2734 . . . . . . . . 9 (𝜑𝑁 ∈ (TopOn‘(𝐵[,]𝐶)))
89 txtopon 21442 . . . . . . . . 9 ((𝑁 ∈ (TopOn‘(𝐵[,]𝐶)) ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝑁 ×t 𝐽) ∈ (TopOn‘((𝐵[,]𝐶) × 𝑋)))
9088, 26, 89syl2anc 694 . . . . . . . 8 (𝜑 → (𝑁 ×t 𝐽) ∈ (TopOn‘((𝐵[,]𝐶) × 𝑋)))
91 elicc2 12276 . . . . . . . . . . . . . . . . . 18 ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝑥 ∈ (𝐵[,]𝐶) ↔ (𝑥 ∈ ℝ ∧ 𝐵𝑥𝑥𝐶)))
928, 4, 91syl2anc 694 . . . . . . . . . . . . . . . . 17 (𝜑 → (𝑥 ∈ (𝐵[,]𝐶) ↔ (𝑥 ∈ ℝ ∧ 𝐵𝑥𝑥𝐶)))
9392biimpa 500 . . . . . . . . . . . . . . . 16 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → (𝑥 ∈ ℝ ∧ 𝐵𝑥𝑥𝐶))
9493simp2d 1094 . . . . . . . . . . . . . . 15 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → 𝐵𝑥)
9594biantrud 527 . . . . . . . . . . . . . 14 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → (𝑥𝐵 ↔ (𝑥𝐵𝐵𝑥)))
9693simp1d 1093 . . . . . . . . . . . . . . 15 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → 𝑥 ∈ ℝ)
978adantr 480 . . . . . . . . . . . . . . 15 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → 𝐵 ∈ ℝ)
9896, 97letri3d 10217 . . . . . . . . . . . . . 14 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → (𝑥 = 𝐵 ↔ (𝑥𝐵𝐵𝑥)))
9995, 98bitr4d 271 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝐵[,]𝐶)) → (𝑥𝐵𝑥 = 𝐵))
100993adant3 1101 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝐵[,]𝐶) ∧ 𝑦𝑋) → (𝑥𝐵𝑥 = 𝐵))
101 cnmpt2pc.q . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ (𝑥 = 𝐵𝑦𝑋)) → 𝐷 = 𝐸)
102101ancom2s 861 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ (𝑦𝑋𝑥 = 𝐵)) → 𝐷 = 𝐸)
103102ifeq1d 4137 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑦𝑋𝑥 = 𝐵)) → if(𝑥𝐵, 𝐷, 𝐸) = if(𝑥𝐵, 𝐸, 𝐸))
104 ifid 4158 . . . . . . . . . . . . . . 15 if(𝑥𝐵, 𝐸, 𝐸) = 𝐸
105103, 104syl6eq 2701 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑦𝑋𝑥 = 𝐵)) → if(𝑥𝐵, 𝐷, 𝐸) = 𝐸)
106105expr 642 . . . . . . . . . . . . 13 ((𝜑𝑦𝑋) → (𝑥 = 𝐵 → if(𝑥𝐵, 𝐷, 𝐸) = 𝐸))
1071063adant2 1100 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝐵[,]𝐶) ∧ 𝑦𝑋) → (𝑥 = 𝐵 → if(𝑥𝐵, 𝐷, 𝐸) = 𝐸))
108100, 107sylbid 230 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (𝐵[,]𝐶) ∧ 𝑦𝑋) → (𝑥𝐵 → if(𝑥𝐵, 𝐷, 𝐸) = 𝐸))
109 iffalse 4128 . . . . . . . . . . 11 𝑥𝐵 → if(𝑥𝐵, 𝐷, 𝐸) = 𝐸)
110108, 109pm2.61d1 171 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝐵[,]𝐶) ∧ 𝑦𝑋) → if(𝑥𝐵, 𝐷, 𝐸) = 𝐸)
111110mpt2eq3dva 6761 . . . . . . . . 9 (𝜑 → (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) = (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋𝐸))
112 cnmpt2pc.e . . . . . . . . 9 (𝜑 → (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋𝐸) ∈ ((𝑁 ×t 𝐽) Cn 𝐾))
113111, 112eqeltrd 2730 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ∈ ((𝑁 ×t 𝐽) Cn 𝐾))
114 cnf2 21101 . . . . . . . 8 (((𝑁 ×t 𝐽) ∈ (TopOn‘((𝐵[,]𝐶) × 𝑋)) ∧ 𝐾 ∈ (TopOn‘ 𝐾) ∧ (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ∈ ((𝑁 ×t 𝐽) Cn 𝐾)) → (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐵[,]𝐶) × 𝑋)⟶ 𝐾)
11590, 70, 113, 114syl3anc 1366 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐵[,]𝐶) × 𝑋)⟶ 𝐾)
116 eqid 2651 . . . . . . . 8 (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) = (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸))
117116fmpt2 7282 . . . . . . 7 (∀𝑥 ∈ (𝐵[,]𝐶)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾 ↔ (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐵[,]𝐶) × 𝑋)⟶ 𝐾)
118115, 117sylibr 224 . . . . . 6 (𝜑 → ∀𝑥 ∈ (𝐵[,]𝐶)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾)
119 ralun 3828 . . . . . 6 ((∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾 ∧ ∀𝑥 ∈ (𝐵[,]𝐶)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾) → ∀𝑥 ∈ ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾)
12083, 118, 119syl2anc 694 . . . . 5 (𝜑 → ∀𝑥 ∈ ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾)
12116raleqdv 3174 . . . . 5 (𝜑 → (∀𝑥 ∈ (𝐴[,]𝐶)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾 ↔ ∀𝑥 ∈ ((𝐴[,]𝐵) ∪ (𝐵[,]𝐶))∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾))
122120, 121mpbird 247 . . . 4 (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐶)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾)
123 eqid 2651 . . . . 5 (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) = (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸))
124123fmpt2 7282 . . . 4 (∀𝑥 ∈ (𝐴[,]𝐶)∀𝑦𝑋 if(𝑥𝐵, 𝐷, 𝐸) ∈ 𝐾 ↔ (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐴[,]𝐶) × 𝑋)⟶ 𝐾)
125122, 124sylib 208 . . 3 (𝜑 → (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐴[,]𝐶) × 𝑋)⟶ 𝐾)
12657feq2d 6069 . . 3 (𝜑 → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)):((𝐴[,]𝐶) × 𝑋)⟶ 𝐾 ↔ (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)): (𝑂 ×t 𝐽)⟶ 𝐾))
127125, 126mpbid 222 . 2 (𝜑 → (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)): (𝑂 ×t 𝐽)⟶ 𝐾)
128 ssid 3657 . . . 4 𝑋𝑋
129 resmpt2 6800 . . . 4 (((𝐴[,]𝐵) ⊆ (𝐴[,]𝐶) ∧ 𝑋𝑋) → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ↾ ((𝐴[,]𝐵) × 𝑋)) = (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)))
13017, 128, 129sylancl 695 . . 3 (𝜑 → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ↾ ((𝐴[,]𝐵) × 𝑋)) = (𝑥 ∈ (𝐴[,]𝐵), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)))
131 retop 22612 . . . . . . . . . 10 (topGen‘ran (,)) ∈ Top
13211, 131eqeltri 2726 . . . . . . . . 9 𝑅 ∈ Top
133 ovex 6718 . . . . . . . . 9 (𝐴[,]𝐶) ∈ V
134 resttop 21012 . . . . . . . . 9 ((𝑅 ∈ Top ∧ (𝐴[,]𝐶) ∈ V) → (𝑅t (𝐴[,]𝐶)) ∈ Top)
135132, 133, 134mp2an 708 . . . . . . . 8 (𝑅t (𝐴[,]𝐶)) ∈ Top
13623, 135eqeltri 2726 . . . . . . 7 𝑂 ∈ Top
137136a1i 11 . . . . . 6 (𝜑𝑂 ∈ Top)
138 ovexd 6720 . . . . . 6 (𝜑 → (𝐴[,]𝐵) ∈ V)
139 txrest 21482 . . . . . 6 (((𝑂 ∈ Top ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ ((𝐴[,]𝐵) ∈ V ∧ 𝑋 ∈ (Clsd‘𝐽))) → ((𝑂 ×t 𝐽) ↾t ((𝐴[,]𝐵) × 𝑋)) = ((𝑂t (𝐴[,]𝐵)) ×t (𝐽t 𝑋)))
140137, 26, 138, 33, 139syl22anc 1367 . . . . 5 (𝜑 → ((𝑂 ×t 𝐽) ↾t ((𝐴[,]𝐵) × 𝑋)) = ((𝑂t (𝐴[,]𝐵)) ×t (𝐽t 𝑋)))
141132a1i 11 . . . . . . . 8 (𝜑𝑅 ∈ Top)
142 ovexd 6720 . . . . . . . 8 (𝜑 → (𝐴[,]𝐶) ∈ V)
143 restabs 21017 . . . . . . . 8 ((𝑅 ∈ Top ∧ (𝐴[,]𝐵) ⊆ (𝐴[,]𝐶) ∧ (𝐴[,]𝐶) ∈ V) → ((𝑅t (𝐴[,]𝐶)) ↾t (𝐴[,]𝐵)) = (𝑅t (𝐴[,]𝐵)))
144141, 17, 142, 143syl3anc 1366 . . . . . . 7 (𝜑 → ((𝑅t (𝐴[,]𝐶)) ↾t (𝐴[,]𝐵)) = (𝑅t (𝐴[,]𝐵)))
14523oveq1i 6700 . . . . . . 7 (𝑂t (𝐴[,]𝐵)) = ((𝑅t (𝐴[,]𝐶)) ↾t (𝐴[,]𝐵))
146144, 145, 593eqtr4g 2710 . . . . . 6 (𝜑 → (𝑂t (𝐴[,]𝐵)) = 𝑀)
14728oveq2d 6706 . . . . . . 7 (𝜑 → (𝐽t 𝑋) = (𝐽t 𝐽))
14830restid 16141 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → (𝐽t 𝐽) = 𝐽)
14926, 148syl 17 . . . . . . 7 (𝜑 → (𝐽t 𝐽) = 𝐽)
150147, 149eqtrd 2685 . . . . . 6 (𝜑 → (𝐽t 𝑋) = 𝐽)
151146, 150oveq12d 6708 . . . . 5 (𝜑 → ((𝑂t (𝐴[,]𝐵)) ×t (𝐽t 𝑋)) = (𝑀 ×t 𝐽))
152140, 151eqtrd 2685 . . . 4 (𝜑 → ((𝑂 ×t 𝐽) ↾t ((𝐴[,]𝐵) × 𝑋)) = (𝑀 ×t 𝐽))
153152oveq1d 6705 . . 3 (𝜑 → (((𝑂 ×t 𝐽) ↾t ((𝐴[,]𝐵) × 𝑋)) Cn 𝐾) = ((𝑀 ×t 𝐽) Cn 𝐾))
15478, 130, 1533eltr4d 2745 . 2 (𝜑 → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ↾ ((𝐴[,]𝐵) × 𝑋)) ∈ (((𝑂 ×t 𝐽) ↾t ((𝐴[,]𝐵) × 𝑋)) Cn 𝐾))
155 resmpt2 6800 . . . 4 (((𝐵[,]𝐶) ⊆ (𝐴[,]𝐶) ∧ 𝑋𝑋) → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ↾ ((𝐵[,]𝐶) × 𝑋)) = (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)))
15640, 128, 155sylancl 695 . . 3 (𝜑 → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ↾ ((𝐵[,]𝐶) × 𝑋)) = (𝑥 ∈ (𝐵[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)))
157 ovexd 6720 . . . . . 6 (𝜑 → (𝐵[,]𝐶) ∈ V)
158 txrest 21482 . . . . . 6 (((𝑂 ∈ Top ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ ((𝐵[,]𝐶) ∈ V ∧ 𝑋 ∈ (Clsd‘𝐽))) → ((𝑂 ×t 𝐽) ↾t ((𝐵[,]𝐶) × 𝑋)) = ((𝑂t (𝐵[,]𝐶)) ×t (𝐽t 𝑋)))
159137, 26, 157, 33, 158syl22anc 1367 . . . . 5 (𝜑 → ((𝑂 ×t 𝐽) ↾t ((𝐵[,]𝐶) × 𝑋)) = ((𝑂t (𝐵[,]𝐶)) ×t (𝐽t 𝑋)))
160 restabs 21017 . . . . . . . 8 ((𝑅 ∈ Top ∧ (𝐵[,]𝐶) ⊆ (𝐴[,]𝐶) ∧ (𝐴[,]𝐶) ∈ V) → ((𝑅t (𝐴[,]𝐶)) ↾t (𝐵[,]𝐶)) = (𝑅t (𝐵[,]𝐶)))
161141, 40, 142, 160syl3anc 1366 . . . . . . 7 (𝜑 → ((𝑅t (𝐴[,]𝐶)) ↾t (𝐵[,]𝐶)) = (𝑅t (𝐵[,]𝐶)))
16223oveq1i 6700 . . . . . . 7 (𝑂t (𝐵[,]𝐶)) = ((𝑅t (𝐴[,]𝐶)) ↾t (𝐵[,]𝐶))
163161, 162, 843eqtr4g 2710 . . . . . 6 (𝜑 → (𝑂t (𝐵[,]𝐶)) = 𝑁)
164163, 150oveq12d 6708 . . . . 5 (𝜑 → ((𝑂t (𝐵[,]𝐶)) ×t (𝐽t 𝑋)) = (𝑁 ×t 𝐽))
165159, 164eqtrd 2685 . . . 4 (𝜑 → ((𝑂 ×t 𝐽) ↾t ((𝐵[,]𝐶) × 𝑋)) = (𝑁 ×t 𝐽))
166165oveq1d 6705 . . 3 (𝜑 → (((𝑂 ×t 𝐽) ↾t ((𝐵[,]𝐶) × 𝑋)) Cn 𝐾) = ((𝑁 ×t 𝐽) Cn 𝐾))
167113, 156, 1663eltr4d 2745 . 2 (𝜑 → ((𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ↾ ((𝐵[,]𝐶) × 𝑋)) ∈ (((𝑂 ×t 𝐽) ↾t ((𝐵[,]𝐶) × 𝑋)) Cn 𝐾))
1681, 2, 35, 45, 58, 127, 154, 167paste 21146 1 (𝜑 → (𝑥 ∈ (𝐴[,]𝐶), 𝑦𝑋 ↦ if(𝑥𝐵, 𝐷, 𝐸)) ∈ ((𝑂 ×t 𝐽) Cn 𝐾))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030  ∀wral 2941  Vcvv 3231   ∪ cun 3605   ⊆ wss 3607  ifcif 4119  ∪ cuni 4468   class class class wbr 4685   × cxp 5141  ran crn 5144   ↾ cres 5145  ⟶wf 5922  ‘cfv 5926  (class class class)co 6690   ↦ cmpt2 6692  ℝcr 9973   ≤ cle 10113  (,)cioo 12213  [,]cicc 12216   ↾t crest 16128  topGenctg 16145  Topctop 20746  TopOnctopon 20763  Clsdccld 20868   Cn ccn 21076   ×t ctx 21411 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-iin 4555  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-oadd 7609  df-er 7787  df-map 7901  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-fi 8358  df-sup 8389  df-inf 8390  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-n0 11331  df-z 11416  df-uz 11726  df-q 11827  df-ioo 12217  df-icc 12220  df-rest 16130  df-topgen 16151  df-top 20747  df-topon 20764  df-bases 20798  df-cld 20871  df-cn 21079  df-tx 21413 This theorem is referenced by:  htpycc  22826  pcocn  22863  pcohtpylem  22865  pcopt  22868  pcopt2  22869  pcoass  22870  pcorevlem  22872
 Copyright terms: Public domain W3C validator