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

Theorem uptx 22325
 Description: Universal property of the binary topological product. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 22-Aug-2015.)
Hypotheses
Ref Expression
uptx.1 𝑇 = (𝑅 ×t 𝑆)
uptx.2 𝑋 = 𝑅
uptx.3 𝑌 = 𝑆
uptx.4 𝑍 = (𝑋 × 𝑌)
uptx.5 𝑃 = (1st𝑍)
uptx.6 𝑄 = (2nd𝑍)
Assertion
Ref Expression
uptx ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
Distinct variable groups:   ,𝐹   ,𝐺   𝑃,   𝑄,   𝑅,   𝑇,   𝑆,   𝑈,   ,𝑋   ,𝑌
Allowed substitution hint:   𝑍()

Proof of Theorem uptx
Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2758 . . . . 5 𝑈 = 𝑈
2 eqid 2758 . . . . 5 (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)
31, 2txcnmpt 22324 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn (𝑅 ×t 𝑆)))
4 uptx.1 . . . . 5 𝑇 = (𝑅 ×t 𝑆)
54oveq2i 7161 . . . 4 (𝑈 Cn 𝑇) = (𝑈 Cn (𝑅 ×t 𝑆))
63, 5eleqtrrdi 2863 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇))
7 uptx.2 . . . . . 6 𝑋 = 𝑅
81, 7cnf 21946 . . . . 5 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝐹: 𝑈𝑋)
9 uptx.3 . . . . . 6 𝑌 = 𝑆
101, 9cnf 21946 . . . . 5 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝐺: 𝑈𝑌)
11 ffn 6498 . . . . . . . 8 (𝐹: 𝑈𝑋𝐹 Fn 𝑈)
1211adantr 484 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐹 Fn 𝑈)
13 fo1st 7713 . . . . . . . . . 10 1st :V–onto→V
14 fofn 6578 . . . . . . . . . 10 (1st :V–onto→V → 1st Fn V)
1513, 14ax-mp 5 . . . . . . . . 9 1st Fn V
16 ssv 3916 . . . . . . . . 9 (𝑋 × 𝑌) ⊆ V
17 fnssres 6453 . . . . . . . . 9 ((1st Fn V ∧ (𝑋 × 𝑌) ⊆ V) → (1st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
1815, 16, 17mp2an 691 . . . . . . . 8 (1st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌)
19 ffvelrn 6840 . . . . . . . . . . . 12 ((𝐹: 𝑈𝑋𝑥 𝑈) → (𝐹𝑥) ∈ 𝑋)
20 ffvelrn 6840 . . . . . . . . . . . 12 ((𝐺: 𝑈𝑌𝑥 𝑈) → (𝐺𝑥) ∈ 𝑌)
21 opelxpi 5561 . . . . . . . . . . . 12 (((𝐹𝑥) ∈ 𝑋 ∧ (𝐺𝑥) ∈ 𝑌) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑋 × 𝑌))
2219, 20, 21syl2an 598 . . . . . . . . . . 11 (((𝐹: 𝑈𝑋𝑥 𝑈) ∧ (𝐺: 𝑈𝑌𝑥 𝑈)) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑋 × 𝑌))
2322anandirs 678 . . . . . . . . . 10 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑥 𝑈) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑋 × 𝑌))
2423fmpttd 6870 . . . . . . . . 9 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌))
25 ffn 6498 . . . . . . . . 9 ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈)
2624, 25syl 17 . . . . . . . 8 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈)
2724frnd 6505 . . . . . . . 8 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ran (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ⊆ (𝑋 × 𝑌))
28 fnco 6448 . . . . . . . 8 (((1st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) ∧ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈 ∧ ran (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ⊆ (𝑋 × 𝑌)) → ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
2918, 26, 27, 28mp3an2i 1463 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
30 fvco3 6751 . . . . . . . . 9 (((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌) ∧ 𝑧 𝑈) → (((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((1st ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
3124, 30sylan 583 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((1st ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
32 fveq2 6658 . . . . . . . . . . . 12 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
33 fveq2 6658 . . . . . . . . . . . 12 (𝑥 = 𝑧 → (𝐺𝑥) = (𝐺𝑧))
3432, 33opeq12d 4771 . . . . . . . . . . 11 (𝑥 = 𝑧 → ⟨(𝐹𝑥), (𝐺𝑥)⟩ = ⟨(𝐹𝑧), (𝐺𝑧)⟩)
35 opex 5324 . . . . . . . . . . 11 ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ V
3634, 2, 35fvmpt 6759 . . . . . . . . . 10 (𝑧 𝑈 → ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧) = ⟨(𝐹𝑧), (𝐺𝑧)⟩)
3736adantl 485 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧) = ⟨(𝐹𝑧), (𝐺𝑧)⟩)
3837fveq2d 6662 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((1st ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)) = ((1st ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
39 ffvelrn 6840 . . . . . . . . . . . 12 ((𝐹: 𝑈𝑋𝑧 𝑈) → (𝐹𝑧) ∈ 𝑋)
40 ffvelrn 6840 . . . . . . . . . . . 12 ((𝐺: 𝑈𝑌𝑧 𝑈) → (𝐺𝑧) ∈ 𝑌)
41 opelxpi 5561 . . . . . . . . . . . 12 (((𝐹𝑧) ∈ 𝑋 ∧ (𝐺𝑧) ∈ 𝑌) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
4239, 40, 41syl2an 598 . . . . . . . . . . 11 (((𝐹: 𝑈𝑋𝑧 𝑈) ∧ (𝐺: 𝑈𝑌𝑧 𝑈)) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
4342anandirs 678 . . . . . . . . . 10 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
4443fvresd 6678 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((1st ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (1st ‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
45 fvex 6671 . . . . . . . . . 10 (𝐹𝑧) ∈ V
46 fvex 6671 . . . . . . . . . 10 (𝐺𝑧) ∈ V
4745, 46op1st 7701 . . . . . . . . 9 (1st ‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐹𝑧)
4844, 47eqtrdi 2809 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((1st ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐹𝑧))
4931, 38, 483eqtrrd 2798 . . . . . . 7 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (𝐹𝑧) = (((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧))
5012, 29, 49eqfnfvd 6796 . . . . . 6 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐹 = ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
51 uptx.5 . . . . . . . 8 𝑃 = (1st𝑍)
52 uptx.4 . . . . . . . . 9 𝑍 = (𝑋 × 𝑌)
5352reseq2i 5820 . . . . . . . 8 (1st𝑍) = (1st ↾ (𝑋 × 𝑌))
5451, 53eqtri 2781 . . . . . . 7 𝑃 = (1st ↾ (𝑋 × 𝑌))
5554coeq1i 5699 . . . . . 6 (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) = ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))
5650, 55eqtr4di 2811 . . . . 5 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
578, 10, 56syl2an 598 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
58 ffn 6498 . . . . . . . 8 (𝐺: 𝑈𝑌𝐺 Fn 𝑈)
5958adantl 485 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐺 Fn 𝑈)
60 fo2nd 7714 . . . . . . . . . 10 2nd :V–onto→V
61 fofn 6578 . . . . . . . . . 10 (2nd :V–onto→V → 2nd Fn V)
6260, 61ax-mp 5 . . . . . . . . 9 2nd Fn V
63 fnssres 6453 . . . . . . . . 9 ((2nd Fn V ∧ (𝑋 × 𝑌) ⊆ V) → (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
6462, 16, 63mp2an 691 . . . . . . . 8 (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌)
65 fnco 6448 . . . . . . . 8 (((2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) ∧ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈 ∧ ran (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ⊆ (𝑋 × 𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
6664, 26, 27, 65mp3an2i 1463 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
67 fvco3 6751 . . . . . . . . 9 (((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌) ∧ 𝑧 𝑈) → (((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((2nd ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
6824, 67sylan 583 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((2nd ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
6937fveq2d 6662 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((2nd ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)) = ((2nd ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
7043fvresd 6678 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((2nd ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (2nd ‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
7145, 46op2nd 7702 . . . . . . . . 9 (2nd ‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐺𝑧)
7270, 71eqtrdi 2809 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((2nd ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐺𝑧))
7368, 69, 723eqtrrd 2798 . . . . . . 7 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (𝐺𝑧) = (((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧))
7459, 66, 73eqfnfvd 6796 . . . . . 6 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐺 = ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
75 uptx.6 . . . . . . . 8 𝑄 = (2nd𝑍)
7652reseq2i 5820 . . . . . . . 8 (2nd𝑍) = (2nd ↾ (𝑋 × 𝑌))
7775, 76eqtri 2781 . . . . . . 7 𝑄 = (2nd ↾ (𝑋 × 𝑌))
7877coeq1i 5699 . . . . . 6 (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) = ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))
7974, 78eqtr4di 2811 . . . . 5 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
808, 10, 79syl2an 598 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
816, 57, 80jca32 519 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))))
82 eleq1 2839 . . . . 5 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → ( ∈ (𝑈 Cn 𝑇) ↔ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇)))
83 coeq2 5698 . . . . . . 7 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝑃) = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
8483eqeq2d 2769 . . . . . 6 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝐹 = (𝑃) ↔ 𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))))
85 coeq2 5698 . . . . . . 7 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝑄) = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
8685eqeq2d 2769 . . . . . 6 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝐺 = (𝑄) ↔ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))))
8784, 86anbi12d 633 . . . . 5 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → ((𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))))
8882, 87anbi12d 633 . . . 4 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ↔ ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))))))
8988spcegv 3515 . . 3 ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) → (((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))) → ∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
906, 81, 89sylc 65 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
91 eqid 2758 . . . . . . . 8 𝑇 = 𝑇
921, 91cnf 21946 . . . . . . 7 ( ∈ (𝑈 Cn 𝑇) → : 𝑈 𝑇)
93 cntop2 21941 . . . . . . . . 9 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ Top)
94 cntop2 21941 . . . . . . . . 9 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ Top)
954unieqi 4811 . . . . . . . . . 10 𝑇 = (𝑅 ×t 𝑆)
967, 9txuni 22292 . . . . . . . . . 10 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑋 × 𝑌) = (𝑅 ×t 𝑆))
9795, 96eqtr4id 2812 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑇 = (𝑋 × 𝑌))
9893, 94, 97syl2an 598 . . . . . . . 8 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑇 = (𝑋 × 𝑌))
9998feq3d 6485 . . . . . . 7 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (: 𝑈 𝑇: 𝑈⟶(𝑋 × 𝑌)))
10092, 99syl5ib 247 . . . . . 6 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ( ∈ (𝑈 Cn 𝑇) → : 𝑈⟶(𝑋 × 𝑌)))
101100anim1d 613 . . . . 5 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
102 3anass 1092 . . . . 5 ((: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ (: 𝑈⟶(𝑋 × 𝑌) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
103101, 102syl6ibr 255 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
104103alrimiv 1928 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀(( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
105 cntop1 21940 . . . . . 6 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑈 ∈ Top)
106105uniexd 7466 . . . . 5 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑈 ∈ V)
10754, 77upxp 22323 . . . . 5 (( 𝑈 ∈ V ∧ 𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ∃!(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
108106, 8, 10, 107syl2an3an 1419 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃!(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
109 eumo 2597 . . . 4 (∃!(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) → ∃*(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
110108, 109syl 17 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃*(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
111 moim 2561 . . 3 (∀(( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (∃*(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) → ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
112104, 110, 111sylc 65 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
113 df-reu 3077 . . 3 (∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ ∃!( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
114 df-eu 2588 . . 3 (∃!( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ↔ (∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ∧ ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
115113, 114bitri 278 . 2 (∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ (∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ∧ ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
11690, 112, 115sylanbrc 586 1 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084  ∀wal 1536   = wceq 1538  ∃wex 1781   ∈ wcel 2111  ∃*wmo 2555  ∃!weu 2587  ∃!wreu 3072  Vcvv 3409   ⊆ wss 3858  ⟨cop 4528  ∪ cuni 4798   ↦ cmpt 5112   × cxp 5522  ran crn 5525   ↾ cres 5526   ∘ ccom 5528   Fn wfn 6330  ⟶wf 6331  –onto→wfo 6333  ‘cfv 6335  (class class class)co 7150  1st c1st 7691  2nd c2nd 7692  Topctop 21593   Cn ccn 21924   ×t ctx 22260 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5156  ax-sep 5169  ax-nul 5176  ax-pow 5234  ax-pr 5298  ax-un 7459 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-reu 3077  df-rab 3079  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-nul 4226  df-if 4421  df-pw 4496  df-sn 4523  df-pr 4525  df-op 4529  df-uni 4799  df-iun 4885  df-br 5033  df-opab 5095  df-mpt 5113  df-id 5430  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-iota 6294  df-fun 6337  df-fn 6338  df-f 6339  df-f1 6340  df-fo 6341  df-f1o 6342  df-fv 6343  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7693  df-2nd 7694  df-map 8418  df-topgen 16775  df-top 21594  df-topon 21611  df-bases 21646  df-cn 21927  df-tx 22262 This theorem is referenced by:  txcn  22326
 Copyright terms: Public domain W3C validator