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

Theorem txuni2 12896
Description: The underlying set of the product of two topologies. (Contributed by Mario Carneiro, 31-Aug-2015.)
Hypotheses
Ref Expression
txval.1 𝐵 = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
txuni2.1 𝑋 = 𝑅
txuni2.2 𝑌 = 𝑆
Assertion
Ref Expression
txuni2 (𝑋 × 𝑌) = 𝐵
Distinct variable groups:   𝑥,𝑦,𝑅   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑦)

Proof of Theorem txuni2
Dummy variables 𝑟 𝑠 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relxp 4713 . . 3 Rel (𝑋 × 𝑌)
2 txuni2.1 . . . . . . . 8 𝑋 = 𝑅
32eleq2i 2233 . . . . . . 7 (𝑧𝑋𝑧 𝑅)
4 eluni2 3793 . . . . . . 7 (𝑧 𝑅 ↔ ∃𝑟𝑅 𝑧𝑟)
53, 4bitri 183 . . . . . 6 (𝑧𝑋 ↔ ∃𝑟𝑅 𝑧𝑟)
6 txuni2.2 . . . . . . . 8 𝑌 = 𝑆
76eleq2i 2233 . . . . . . 7 (𝑤𝑌𝑤 𝑆)
8 eluni2 3793 . . . . . . 7 (𝑤 𝑆 ↔ ∃𝑠𝑆 𝑤𝑠)
97, 8bitri 183 . . . . . 6 (𝑤𝑌 ↔ ∃𝑠𝑆 𝑤𝑠)
105, 9anbi12i 456 . . . . 5 ((𝑧𝑋𝑤𝑌) ↔ (∃𝑟𝑅 𝑧𝑟 ∧ ∃𝑠𝑆 𝑤𝑠))
11 opelxp 4634 . . . . 5 (⟨𝑧, 𝑤⟩ ∈ (𝑋 × 𝑌) ↔ (𝑧𝑋𝑤𝑌))
12 reeanv 2635 . . . . 5 (∃𝑟𝑅𝑠𝑆 (𝑧𝑟𝑤𝑠) ↔ (∃𝑟𝑅 𝑧𝑟 ∧ ∃𝑠𝑆 𝑤𝑠))
1310, 11, 123bitr4i 211 . . . 4 (⟨𝑧, 𝑤⟩ ∈ (𝑋 × 𝑌) ↔ ∃𝑟𝑅𝑠𝑆 (𝑧𝑟𝑤𝑠))
14 opelxp 4634 . . . . . 6 (⟨𝑧, 𝑤⟩ ∈ (𝑟 × 𝑠) ↔ (𝑧𝑟𝑤𝑠))
15 eqid 2165 . . . . . . . . . 10 (𝑟 × 𝑠) = (𝑟 × 𝑠)
16 xpeq1 4618 . . . . . . . . . . . 12 (𝑥 = 𝑟 → (𝑥 × 𝑦) = (𝑟 × 𝑦))
1716eqeq2d 2177 . . . . . . . . . . 11 (𝑥 = 𝑟 → ((𝑟 × 𝑠) = (𝑥 × 𝑦) ↔ (𝑟 × 𝑠) = (𝑟 × 𝑦)))
18 xpeq2 4619 . . . . . . . . . . . 12 (𝑦 = 𝑠 → (𝑟 × 𝑦) = (𝑟 × 𝑠))
1918eqeq2d 2177 . . . . . . . . . . 11 (𝑦 = 𝑠 → ((𝑟 × 𝑠) = (𝑟 × 𝑦) ↔ (𝑟 × 𝑠) = (𝑟 × 𝑠)))
2017, 19rspc2ev 2845 . . . . . . . . . 10 ((𝑟𝑅𝑠𝑆 ∧ (𝑟 × 𝑠) = (𝑟 × 𝑠)) → ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦))
2115, 20mp3an3 1316 . . . . . . . . 9 ((𝑟𝑅𝑠𝑆) → ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦))
22 vex 2729 . . . . . . . . . . 11 𝑟 ∈ V
23 vex 2729 . . . . . . . . . . 11 𝑠 ∈ V
2422, 23xpex 4719 . . . . . . . . . 10 (𝑟 × 𝑠) ∈ V
25 eqeq1 2172 . . . . . . . . . . 11 (𝑧 = (𝑟 × 𝑠) → (𝑧 = (𝑥 × 𝑦) ↔ (𝑟 × 𝑠) = (𝑥 × 𝑦)))
26252rexbidv 2491 . . . . . . . . . 10 (𝑧 = (𝑟 × 𝑠) → (∃𝑥𝑅𝑦𝑆 𝑧 = (𝑥 × 𝑦) ↔ ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦)))
27 txval.1 . . . . . . . . . . 11 𝐵 = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
28 eqid 2165 . . . . . . . . . . . 12 (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) = (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
2928rnmpo 5952 . . . . . . . . . . 11 ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) = {𝑧 ∣ ∃𝑥𝑅𝑦𝑆 𝑧 = (𝑥 × 𝑦)}
3027, 29eqtri 2186 . . . . . . . . . 10 𝐵 = {𝑧 ∣ ∃𝑥𝑅𝑦𝑆 𝑧 = (𝑥 × 𝑦)}
3124, 26, 30elab2 2874 . . . . . . . . 9 ((𝑟 × 𝑠) ∈ 𝐵 ↔ ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦))
3221, 31sylibr 133 . . . . . . . 8 ((𝑟𝑅𝑠𝑆) → (𝑟 × 𝑠) ∈ 𝐵)
33 elssuni 3817 . . . . . . . 8 ((𝑟 × 𝑠) ∈ 𝐵 → (𝑟 × 𝑠) ⊆ 𝐵)
3432, 33syl 14 . . . . . . 7 ((𝑟𝑅𝑠𝑆) → (𝑟 × 𝑠) ⊆ 𝐵)
3534sseld 3141 . . . . . 6 ((𝑟𝑅𝑠𝑆) → (⟨𝑧, 𝑤⟩ ∈ (𝑟 × 𝑠) → ⟨𝑧, 𝑤⟩ ∈ 𝐵))
3614, 35syl5bir 152 . . . . 5 ((𝑟𝑅𝑠𝑆) → ((𝑧𝑟𝑤𝑠) → ⟨𝑧, 𝑤⟩ ∈ 𝐵))
3736rexlimivv 2589 . . . 4 (∃𝑟𝑅𝑠𝑆 (𝑧𝑟𝑤𝑠) → ⟨𝑧, 𝑤⟩ ∈ 𝐵)
3813, 37sylbi 120 . . 3 (⟨𝑧, 𝑤⟩ ∈ (𝑋 × 𝑌) → ⟨𝑧, 𝑤⟩ ∈ 𝐵)
391, 38relssi 4695 . 2 (𝑋 × 𝑌) ⊆ 𝐵
40 elssuni 3817 . . . . . . . . . 10 (𝑥𝑅𝑥 𝑅)
4140, 2sseqtrrdi 3191 . . . . . . . . 9 (𝑥𝑅𝑥𝑋)
42 elssuni 3817 . . . . . . . . . 10 (𝑦𝑆𝑦 𝑆)
4342, 6sseqtrrdi 3191 . . . . . . . . 9 (𝑦𝑆𝑦𝑌)
44 xpss12 4711 . . . . . . . . 9 ((𝑥𝑋𝑦𝑌) → (𝑥 × 𝑦) ⊆ (𝑋 × 𝑌))
4541, 43, 44syl2an 287 . . . . . . . 8 ((𝑥𝑅𝑦𝑆) → (𝑥 × 𝑦) ⊆ (𝑋 × 𝑌))
46 vex 2729 . . . . . . . . . 10 𝑥 ∈ V
47 vex 2729 . . . . . . . . . 10 𝑦 ∈ V
4846, 47xpex 4719 . . . . . . . . 9 (𝑥 × 𝑦) ∈ V
4948elpw 3565 . . . . . . . 8 ((𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌) ↔ (𝑥 × 𝑦) ⊆ (𝑋 × 𝑌))
5045, 49sylibr 133 . . . . . . 7 ((𝑥𝑅𝑦𝑆) → (𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌))
5150rgen2 2552 . . . . . 6 𝑥𝑅𝑦𝑆 (𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌)
5228fmpo 6169 . . . . . 6 (∀𝑥𝑅𝑦𝑆 (𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌) ↔ (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)):(𝑅 × 𝑆)⟶𝒫 (𝑋 × 𝑌))
5351, 52mpbi 144 . . . . 5 (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)):(𝑅 × 𝑆)⟶𝒫 (𝑋 × 𝑌)
54 frn 5346 . . . . 5 ((𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)):(𝑅 × 𝑆)⟶𝒫 (𝑋 × 𝑌) → ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ⊆ 𝒫 (𝑋 × 𝑌))
5553, 54ax-mp 5 . . . 4 ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ⊆ 𝒫 (𝑋 × 𝑌)
5627, 55eqsstri 3174 . . 3 𝐵 ⊆ 𝒫 (𝑋 × 𝑌)
57 sspwuni 3950 . . 3 (𝐵 ⊆ 𝒫 (𝑋 × 𝑌) ↔ 𝐵 ⊆ (𝑋 × 𝑌))
5856, 57mpbi 144 . 2 𝐵 ⊆ (𝑋 × 𝑌)
5939, 58eqssi 3158 1 (𝑋 × 𝑌) = 𝐵
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1343  wcel 2136  {cab 2151  wral 2444  wrex 2445  wss 3116  𝒫 cpw 3559  cop 3579   cuni 3789   × cxp 4602  ran crn 4605  wf 5184  cmpo 5844
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109
This theorem is referenced by:  txbasex  12897  txtopon  12902
  Copyright terms: Public domain W3C validator