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

Theorem txval 15356
Description: Value of the binary topological product operation. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 30-Aug-2015.)
Hypothesis
Ref Expression
txval.1 𝐵 = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
Assertion
Ref Expression
txval ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘𝐵))
Distinct variable groups:   𝑥,𝑦,𝑅   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐵(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem txval
Dummy variables 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . . 4 (𝑅𝑉𝑅 ∈ V)
21adantr 276 . . 3 ((𝑅𝑉𝑆𝑊) → 𝑅 ∈ V)
3 elex 2833 . . . 4 (𝑆𝑊𝑆 ∈ V)
43adantl 277 . . 3 ((𝑅𝑉𝑆𝑊) → 𝑆 ∈ V)
5 mpoexga 6448 . . . 4 ((𝑅𝑉𝑆𝑊) → (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V)
6 rnexg 5047 . . . 4 ((𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V → ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V)
7 tgvalex 13617 . . . 4 (ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V → (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))) ∈ V)
85, 6, 73syl 17 . . 3 ((𝑅𝑉𝑆𝑊) → (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))) ∈ V)
9 mpoeq12 6148 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦)) = (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)))
109rneqd 5011 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → ran (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦)) = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)))
1110fveq2d 5699 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → (topGen‘ran (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦))) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))))
12 df-tx 15354 . . . 4 ×t = (𝑟 ∈ V, 𝑠 ∈ V ↦ (topGen‘ran (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦))))
1311, 12ovmpoga 6218 . . 3 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))) ∈ V) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))))
142, 4, 8, 13syl3anc 1278 . 2 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))))
15 txval.1 . . 3 𝐵 = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
1615fveq2i 5698 . 2 (topGen‘𝐵) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)))
1714, 16eqtr4di 2289 1 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘𝐵))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  Vcvv 2821   × cxp 4772  ran crn 4775  cfv 5377  (class class class)co 6085  cmpo 6087  topGenctg 13608   ×t ctx 15353
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-topgen 13614  df-tx 15354
This theorem is used by:  eltx  15360  txtop  15361  txtopon  15363  txopn  15366  txss12  15367  txbasval  15368  txcnp  15372  txcnmpt  15374  txrest  15377  txlm  15380  xmettxlem  15610  xmettx  15611
  Copyright terms: Public domain W3C validator