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

Theorem txuni2 12425
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 4648 . . 3 Rel (𝑋 × 𝑌)
2 txuni2.1 . . . . . . . 8 𝑋 = 𝑅
32eleq2i 2206 . . . . . . 7 (𝑧𝑋𝑧 𝑅)
4 eluni2 3740 . . . . . . 7 (𝑧 𝑅 ↔ ∃𝑟𝑅 𝑧𝑟)
53, 4bitri 183 . . . . . 6 (𝑧𝑋 ↔ ∃𝑟𝑅 𝑧𝑟)
6 txuni2.2 . . . . . . . 8 𝑌 = 𝑆
76eleq2i 2206 . . . . . . 7 (𝑤𝑌𝑤 𝑆)
8 eluni2 3740 . . . . . . 7 (𝑤 𝑆 ↔ ∃𝑠𝑆 𝑤𝑠)
97, 8bitri 183 . . . . . 6 (𝑤𝑌 ↔ ∃𝑠𝑆 𝑤𝑠)
105, 9anbi12i 455 . . . . 5 ((𝑧𝑋𝑤𝑌) ↔ (∃𝑟𝑅 𝑧𝑟 ∧ ∃𝑠𝑆 𝑤𝑠))
11 opelxp 4569 . . . . 5 (⟨𝑧, 𝑤⟩ ∈ (𝑋 × 𝑌) ↔ (𝑧𝑋𝑤𝑌))
12 reeanv 2600 . . . . 5 (∃𝑟𝑅𝑠𝑆 (𝑧𝑟𝑤𝑠) ↔ (∃𝑟𝑅 𝑧𝑟 ∧ ∃𝑠𝑆 𝑤𝑠))
1310, 11, 123bitr4i 211 . . . 4 (⟨𝑧, 𝑤⟩ ∈ (𝑋 × 𝑌) ↔ ∃𝑟𝑅𝑠𝑆 (𝑧𝑟𝑤𝑠))
14 opelxp 4569 . . . . . 6 (⟨𝑧, 𝑤⟩ ∈ (𝑟 × 𝑠) ↔ (𝑧𝑟𝑤𝑠))
15 eqid 2139 . . . . . . . . . 10 (𝑟 × 𝑠) = (𝑟 × 𝑠)
16 xpeq1 4553 . . . . . . . . . . . 12 (𝑥 = 𝑟 → (𝑥 × 𝑦) = (𝑟 × 𝑦))
1716eqeq2d 2151 . . . . . . . . . . 11 (𝑥 = 𝑟 → ((𝑟 × 𝑠) = (𝑥 × 𝑦) ↔ (𝑟 × 𝑠) = (𝑟 × 𝑦)))
18 xpeq2 4554 . . . . . . . . . . . 12 (𝑦 = 𝑠 → (𝑟 × 𝑦) = (𝑟 × 𝑠))
1918eqeq2d 2151 . . . . . . . . . . 11 (𝑦 = 𝑠 → ((𝑟 × 𝑠) = (𝑟 × 𝑦) ↔ (𝑟 × 𝑠) = (𝑟 × 𝑠)))
2017, 19rspc2ev 2804 . . . . . . . . . 10 ((𝑟𝑅𝑠𝑆 ∧ (𝑟 × 𝑠) = (𝑟 × 𝑠)) → ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦))
2115, 20mp3an3 1304 . . . . . . . . 9 ((𝑟𝑅𝑠𝑆) → ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦))
22 vex 2689 . . . . . . . . . . 11 𝑟 ∈ V
23 vex 2689 . . . . . . . . . . 11 𝑠 ∈ V
2422, 23xpex 4654 . . . . . . . . . 10 (𝑟 × 𝑠) ∈ V
25 eqeq1 2146 . . . . . . . . . . 11 (𝑧 = (𝑟 × 𝑠) → (𝑧 = (𝑥 × 𝑦) ↔ (𝑟 × 𝑠) = (𝑥 × 𝑦)))
26252rexbidv 2460 . . . . . . . . . 10 (𝑧 = (𝑟 × 𝑠) → (∃𝑥𝑅𝑦𝑆 𝑧 = (𝑥 × 𝑦) ↔ ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦)))
27 txval.1 . . . . . . . . . . 11 𝐵 = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
28 eqid 2139 . . . . . . . . . . . 12 (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) = (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
2928rnmpo 5881 . . . . . . . . . . 11 ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) = {𝑧 ∣ ∃𝑥𝑅𝑦𝑆 𝑧 = (𝑥 × 𝑦)}
3027, 29eqtri 2160 . . . . . . . . . 10 𝐵 = {𝑧 ∣ ∃𝑥𝑅𝑦𝑆 𝑧 = (𝑥 × 𝑦)}
3124, 26, 30elab2 2832 . . . . . . . . 9 ((𝑟 × 𝑠) ∈ 𝐵 ↔ ∃𝑥𝑅𝑦𝑆 (𝑟 × 𝑠) = (𝑥 × 𝑦))
3221, 31sylibr 133 . . . . . . . 8 ((𝑟𝑅𝑠𝑆) → (𝑟 × 𝑠) ∈ 𝐵)
33 elssuni 3764 . . . . . . . 8 ((𝑟 × 𝑠) ∈ 𝐵 → (𝑟 × 𝑠) ⊆ 𝐵)
3432, 33syl 14 . . . . . . 7 ((𝑟𝑅𝑠𝑆) → (𝑟 × 𝑠) ⊆ 𝐵)
3534sseld 3096 . . . . . 6 ((𝑟𝑅𝑠𝑆) → (⟨𝑧, 𝑤⟩ ∈ (𝑟 × 𝑠) → ⟨𝑧, 𝑤⟩ ∈ 𝐵))
3614, 35syl5bir 152 . . . . 5 ((𝑟𝑅𝑠𝑆) → ((𝑧𝑟𝑤𝑠) → ⟨𝑧, 𝑤⟩ ∈ 𝐵))
3736rexlimivv 2555 . . . 4 (∃𝑟𝑅𝑠𝑆 (𝑧𝑟𝑤𝑠) → ⟨𝑧, 𝑤⟩ ∈ 𝐵)
3813, 37sylbi 120 . . 3 (⟨𝑧, 𝑤⟩ ∈ (𝑋 × 𝑌) → ⟨𝑧, 𝑤⟩ ∈ 𝐵)
391, 38relssi 4630 . 2 (𝑋 × 𝑌) ⊆ 𝐵
40 elssuni 3764 . . . . . . . . . 10 (𝑥𝑅𝑥 𝑅)
4140, 2sseqtrrdi 3146 . . . . . . . . 9 (𝑥𝑅𝑥𝑋)
42 elssuni 3764 . . . . . . . . . 10 (𝑦𝑆𝑦 𝑆)
4342, 6sseqtrrdi 3146 . . . . . . . . 9 (𝑦𝑆𝑦𝑌)
44 xpss12 4646 . . . . . . . . 9 ((𝑥𝑋𝑦𝑌) → (𝑥 × 𝑦) ⊆ (𝑋 × 𝑌))
4541, 43, 44syl2an 287 . . . . . . . 8 ((𝑥𝑅𝑦𝑆) → (𝑥 × 𝑦) ⊆ (𝑋 × 𝑌))
46 vex 2689 . . . . . . . . . 10 𝑥 ∈ V
47 vex 2689 . . . . . . . . . 10 𝑦 ∈ V
4846, 47xpex 4654 . . . . . . . . 9 (𝑥 × 𝑦) ∈ V
4948elpw 3516 . . . . . . . 8 ((𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌) ↔ (𝑥 × 𝑦) ⊆ (𝑋 × 𝑌))
5045, 49sylibr 133 . . . . . . 7 ((𝑥𝑅𝑦𝑆) → (𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌))
5150rgen2 2518 . . . . . 6 𝑥𝑅𝑦𝑆 (𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌)
5228fmpo 6099 . . . . . 6 (∀𝑥𝑅𝑦𝑆 (𝑥 × 𝑦) ∈ 𝒫 (𝑋 × 𝑌) ↔ (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)):(𝑅 × 𝑆)⟶𝒫 (𝑋 × 𝑌))
5351, 52mpbi 144 . . . . 5 (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)):(𝑅 × 𝑆)⟶𝒫 (𝑋 × 𝑌)
54 frn 5281 . . . . 5 ((𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)):(𝑅 × 𝑆)⟶𝒫 (𝑋 × 𝑌) → ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ⊆ 𝒫 (𝑋 × 𝑌))
5553, 54ax-mp 5 . . . 4 ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ⊆ 𝒫 (𝑋 × 𝑌)
5627, 55eqsstri 3129 . . 3 𝐵 ⊆ 𝒫 (𝑋 × 𝑌)
57 sspwuni 3897 . . 3 (𝐵 ⊆ 𝒫 (𝑋 × 𝑌) ↔ 𝐵 ⊆ (𝑋 × 𝑌))
5856, 57mpbi 144 . 2 𝐵 ⊆ (𝑋 × 𝑌)
5939, 58eqssi 3113 1 (𝑋 × 𝑌) = 𝐵
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1331  wcel 1480  {cab 2125  wral 2416  wrex 2417  wss 3071  𝒫 cpw 3510  cop 3530   cuni 3736   × cxp 4537  ran crn 4540  wf 5119  cmpo 5776
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039
This theorem is referenced by:  txbasex  12426  txtopon  12431
  Copyright terms: Public domain W3C validator