ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uptx GIF version

Theorem uptx 14510
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 2196 . . . . 5 𝑈 = 𝑈
2 eqid 2196 . . . . 5 (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)
31, 2txcnmpt 14509 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn (𝑅 ×t 𝑆)))
4 uptx.1 . . . . 5 𝑇 = (𝑅 ×t 𝑆)
54oveq2i 5933 . . . 4 (𝑈 Cn 𝑇) = (𝑈 Cn (𝑅 ×t 𝑆))
63, 5eleqtrrdi 2290 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇))
7 uptx.2 . . . . . 6 𝑋 = 𝑅
81, 7cnf 14440 . . . . 5 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝐹: 𝑈𝑋)
9 uptx.3 . . . . . 6 𝑌 = 𝑆
101, 9cnf 14440 . . . . 5 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝐺: 𝑈𝑌)
11 ffn 5407 . . . . . . . 8 (𝐹: 𝑈𝑋𝐹 Fn 𝑈)
1211adantr 276 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐹 Fn 𝑈)
13 fo1st 6215 . . . . . . . . . 10 1st :V–onto→V
14 fofn 5482 . . . . . . . . . 10 (1st :V–onto→V → 1st Fn V)
1513, 14ax-mp 5 . . . . . . . . 9 1st Fn V
16 ssv 3205 . . . . . . . . 9 (𝑋 × 𝑌) ⊆ V
17 fnssres 5371 . . . . . . . . 9 ((1st Fn V ∧ (𝑋 × 𝑌) ⊆ V) → (1st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
1815, 16, 17mp2an 426 . . . . . . . 8 (1st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌)
19 ffvelcdm 5695 . . . . . . . . . . . 12 ((𝐹: 𝑈𝑋𝑥 𝑈) → (𝐹𝑥) ∈ 𝑋)
20 ffvelcdm 5695 . . . . . . . . . . . 12 ((𝐺: 𝑈𝑌𝑥 𝑈) → (𝐺𝑥) ∈ 𝑌)
21 opelxpi 4695 . . . . . . . . . . . 12 (((𝐹𝑥) ∈ 𝑋 ∧ (𝐺𝑥) ∈ 𝑌) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑋 × 𝑌))
2219, 20, 21syl2an 289 . . . . . . . . . . 11 (((𝐹: 𝑈𝑋𝑥 𝑈) ∧ (𝐺: 𝑈𝑌𝑥 𝑈)) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑋 × 𝑌))
2322anandirs 593 . . . . . . . . . 10 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑥 𝑈) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑋 × 𝑌))
2423fmpttd 5717 . . . . . . . . 9 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌))
2524ffnd 5408 . . . . . . . 8 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈)
2624frnd 5417 . . . . . . . 8 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ran (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ⊆ (𝑋 × 𝑌))
27 fnco 5366 . . . . . . . 8 (((1st ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) ∧ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈 ∧ ran (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ⊆ (𝑋 × 𝑌)) → ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
2818, 25, 26, 27mp3an2i 1353 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
29 fvco3 5632 . . . . . . . . 9 (((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌) ∧ 𝑧 𝑈) → (((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((1st ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
3024, 29sylan 283 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((1st ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
31 fveq2 5558 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
32 fveq2 5558 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝐺𝑥) = (𝐺𝑧))
3331, 32opeq12d 3816 . . . . . . . . . 10 (𝑥 = 𝑧 → ⟨(𝐹𝑥), (𝐺𝑥)⟩ = ⟨(𝐹𝑧), (𝐺𝑧)⟩)
34 simpr 110 . . . . . . . . . 10 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → 𝑧 𝑈)
35 simpll 527 . . . . . . . . . . . 12 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → 𝐹: 𝑈𝑋)
3635, 34ffvelcdmd 5698 . . . . . . . . . . 11 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (𝐹𝑧) ∈ 𝑋)
37 simplr 528 . . . . . . . . . . . 12 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → 𝐺: 𝑈𝑌)
3837, 34ffvelcdmd 5698 . . . . . . . . . . 11 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (𝐺𝑧) ∈ 𝑌)
3936, 38opelxpd 4696 . . . . . . . . . 10 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
402, 33, 34, 39fvmptd3 5655 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧) = ⟨(𝐹𝑧), (𝐺𝑧)⟩)
4140fveq2d 5562 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((1st ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)) = ((1st ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
42 ffvelcdm 5695 . . . . . . . . . . . 12 ((𝐹: 𝑈𝑋𝑧 𝑈) → (𝐹𝑧) ∈ 𝑋)
43 ffvelcdm 5695 . . . . . . . . . . . 12 ((𝐺: 𝑈𝑌𝑧 𝑈) → (𝐺𝑧) ∈ 𝑌)
44 opelxpi 4695 . . . . . . . . . . . 12 (((𝐹𝑧) ∈ 𝑋 ∧ (𝐺𝑧) ∈ 𝑌) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
4542, 43, 44syl2an 289 . . . . . . . . . . 11 (((𝐹: 𝑈𝑋𝑧 𝑈) ∧ (𝐺: 𝑈𝑌𝑧 𝑈)) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
4645anandirs 593 . . . . . . . . . 10 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ⟨(𝐹𝑧), (𝐺𝑧)⟩ ∈ (𝑋 × 𝑌))
4746fvresd 5583 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((1st ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (1st ‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
48 op1stg 6208 . . . . . . . . . 10 (((𝐹𝑧) ∈ 𝑋 ∧ (𝐺𝑧) ∈ 𝑌) → (1st ‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐹𝑧))
4936, 38, 48syl2anc 411 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (1st ‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐹𝑧))
5047, 49eqtrd 2229 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((1st ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐹𝑧))
5130, 41, 503eqtrrd 2234 . . . . . . 7 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (𝐹𝑧) = (((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧))
5212, 28, 51eqfnfvd 5662 . . . . . 6 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐹 = ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
53 uptx.5 . . . . . . . 8 𝑃 = (1st𝑍)
54 uptx.4 . . . . . . . . 9 𝑍 = (𝑋 × 𝑌)
5554reseq2i 4943 . . . . . . . 8 (1st𝑍) = (1st ↾ (𝑋 × 𝑌))
5653, 55eqtri 2217 . . . . . . 7 𝑃 = (1st ↾ (𝑋 × 𝑌))
5756coeq1i 4825 . . . . . 6 (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) = ((1st ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))
5852, 57eqtr4di 2247 . . . . 5 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
598, 10, 58syl2an 289 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
60 ffn 5407 . . . . . . . 8 (𝐺: 𝑈𝑌𝐺 Fn 𝑈)
6160adantl 277 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐺 Fn 𝑈)
62 fo2nd 6216 . . . . . . . . . 10 2nd :V–onto→V
63 fofn 5482 . . . . . . . . . 10 (2nd :V–onto→V → 2nd Fn V)
6462, 63ax-mp 5 . . . . . . . . 9 2nd Fn V
65 fnssres 5371 . . . . . . . . 9 ((2nd Fn V ∧ (𝑋 × 𝑌) ⊆ V) → (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌))
6664, 16, 65mp2an 426 . . . . . . . 8 (2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌)
67 fnco 5366 . . . . . . . 8 (((2nd ↾ (𝑋 × 𝑌)) Fn (𝑋 × 𝑌) ∧ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) Fn 𝑈 ∧ ran (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ⊆ (𝑋 × 𝑌)) → ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
6866, 25, 26, 67mp3an2i 1353 . . . . . . 7 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) Fn 𝑈)
69 fvco3 5632 . . . . . . . . 9 (((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩): 𝑈⟶(𝑋 × 𝑌) ∧ 𝑧 𝑈) → (((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((2nd ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
7024, 69sylan 283 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧) = ((2nd ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)))
7140fveq2d 5562 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((2nd ↾ (𝑋 × 𝑌))‘((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)‘𝑧)) = ((2nd ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
7246fvresd 5583 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((2nd ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (2nd ‘⟨(𝐹𝑧), (𝐺𝑧)⟩))
73 op2ndg 6209 . . . . . . . . . 10 (((𝐹𝑧) ∈ 𝑋 ∧ (𝐺𝑧) ∈ 𝑌) → (2nd ‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐺𝑧))
7436, 38, 73syl2anc 411 . . . . . . . . 9 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (2nd ‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐺𝑧))
7572, 74eqtrd 2229 . . . . . . . 8 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → ((2nd ↾ (𝑋 × 𝑌))‘⟨(𝐹𝑧), (𝐺𝑧)⟩) = (𝐺𝑧))
7670, 71, 753eqtrrd 2234 . . . . . . 7 (((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) ∧ 𝑧 𝑈) → (𝐺𝑧) = (((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))‘𝑧))
7761, 68, 76eqfnfvd 5662 . . . . . 6 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐺 = ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
78 uptx.6 . . . . . . . 8 𝑄 = (2nd𝑍)
7954reseq2i 4943 . . . . . . . 8 (2nd𝑍) = (2nd ↾ (𝑋 × 𝑌))
8078, 79eqtri 2217 . . . . . . 7 𝑄 = (2nd ↾ (𝑋 × 𝑌))
8180coeq1i 4825 . . . . . 6 (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) = ((2nd ↾ (𝑋 × 𝑌)) ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))
8277, 81eqtr4di 2247 . . . . 5 ((𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
838, 10, 82syl2an 289 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
846, 59, 83jca32 310 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))))
85 eleq1 2259 . . . . 5 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → ( ∈ (𝑈 Cn 𝑇) ↔ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇)))
86 coeq2 4824 . . . . . . 7 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝑃) = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
8786eqeq2d 2208 . . . . . 6 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝐹 = (𝑃) ↔ 𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))))
88 coeq2 4824 . . . . . . 7 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝑄) = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))
8988eqeq2d 2208 . . . . . 6 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (𝐺 = (𝑄) ↔ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))))
9087, 89anbi12d 473 . . . . 5 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → ((𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))))
9185, 90anbi12d 473 . . . 4 ( = (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) → (( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ↔ ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩))))))
9291spcegv 2852 . . 3 ((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) → (((𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩) ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)) ∧ 𝐺 = (𝑄 ∘ (𝑥 𝑈 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)))) → ∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
936, 84, 92sylc 62 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
94 eqid 2196 . . . . . . . 8 𝑇 = 𝑇
951, 94cnf 14440 . . . . . . 7 ( ∈ (𝑈 Cn 𝑇) → : 𝑈 𝑇)
96 cntop2 14438 . . . . . . . . 9 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ Top)
97 cntop2 14438 . . . . . . . . 9 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ Top)
984unieqi 3849 . . . . . . . . . 10 𝑇 = (𝑅 ×t 𝑆)
997, 9txuni 14499 . . . . . . . . . 10 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑋 × 𝑌) = (𝑅 ×t 𝑆))
10098, 99eqtr4id 2248 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑇 = (𝑋 × 𝑌))
10196, 97, 100syl2an 289 . . . . . . . 8 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑇 = (𝑋 × 𝑌))
102101feq3d 5396 . . . . . . 7 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (: 𝑈 𝑇: 𝑈⟶(𝑋 × 𝑌)))
10395, 102imbitrid 154 . . . . . 6 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ( ∈ (𝑈 Cn 𝑇) → : 𝑈⟶(𝑋 × 𝑌)))
104103anim1d 336 . . . . 5 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
105 3anass 984 . . . . 5 ((: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ (: 𝑈⟶(𝑋 × 𝑌) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
106104, 105imbitrrdi 162 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
107106alrimiv 1888 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀(( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
108 cntop1 14437 . . . . . 6 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑈 ∈ Top)
109 uniexg 4474 . . . . . 6 (𝑈 ∈ Top → 𝑈 ∈ V)
110108, 109syl 14 . . . . 5 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑈 ∈ V)
11156, 80upxp 14508 . . . . 5 (( 𝑈 ∈ V ∧ 𝐹: 𝑈𝑋𝐺: 𝑈𝑌) → ∃!(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
112110, 8, 10, 111syl2an3an 1309 . . . 4 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃!(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
113 eumo 2077 . . . 4 (∃!(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) → ∃*(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
114112, 113syl 14 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃*(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
115 moim 2109 . . 3 (∀(( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) → (∃*(: 𝑈⟶(𝑋 × 𝑌) ∧ 𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) → ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
116107, 114, 115sylc 62 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
117 df-reu 2482 . . 3 (∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ ∃!( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))))
118 eu5 2092 . . 3 (∃!( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ↔ (∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ∧ ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
119117, 118bitri 184 . 2 (∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)) ↔ (∃( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄))) ∧ ∃*( ∈ (𝑈 Cn 𝑇) ∧ (𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))))
12093, 116, 119sylanbrc 417 1 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∃! ∈ (𝑈 Cn 𝑇)(𝐹 = (𝑃) ∧ 𝐺 = (𝑄)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980  wal 1362   = wceq 1364  wex 1506  ∃!weu 2045  ∃*wmo 2046  wcel 2167  ∃!wreu 2477  Vcvv 2763  wss 3157  cop 3625   cuni 3839  cmpt 4094   × cxp 4661  ran crn 4664  cres 4665  ccom 4667   Fn wfn 5253  wf 5254  ontowfo 5256  cfv 5258  (class class class)co 5922  1st c1st 6196  2nd c2nd 6197  Topctop 14233   Cn ccn 14421   ×t ctx 14488
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-map 6709  df-topgen 12931  df-top 14234  df-topon 14247  df-bases 14279  df-cn 14424  df-tx 14489
This theorem is referenced by:  txcn  14511
  Copyright terms: Public domain W3C validator