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

Theorem txval 15066
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 2815 . . . 4 (𝑅𝑉𝑅 ∈ V)
21adantr 276 . . 3 ((𝑅𝑉𝑆𝑊) → 𝑅 ∈ V)
3 elex 2815 . . . 4 (𝑆𝑊𝑆 ∈ V)
43adantl 277 . . 3 ((𝑅𝑉𝑆𝑊) → 𝑆 ∈ V)
5 mpoexga 6386 . . . 4 ((𝑅𝑉𝑆𝑊) → (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V)
6 rnexg 5003 . . . 4 ((𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V → ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V)
7 tgvalex 13426 . . . 4 (ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)) ∈ V → (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))) ∈ V)
85, 6, 73syl 17 . . 3 ((𝑅𝑉𝑆𝑊) → (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))) ∈ V)
9 mpoeq12 6091 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦)) = (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)))
109rneqd 4967 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → ran (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦)) = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)))
1110fveq2d 5652 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → (topGen‘ran (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦))) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))))
12 df-tx 15064 . . . 4 ×t = (𝑟 ∈ V, 𝑠 ∈ V ↦ (topGen‘ran (𝑥𝑟, 𝑦𝑠 ↦ (𝑥 × 𝑦))))
1311, 12ovmpoga 6161 . . 3 ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))) ∈ V) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))))
142, 4, 8, 13syl3anc 1274 . 2 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))))
15 txval.1 . . 3 𝐵 = ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦))
1615fveq2i 5651 . 2 (topGen‘𝐵) = (topGen‘ran (𝑥𝑅, 𝑦𝑆 ↦ (𝑥 × 𝑦)))
1714, 16eqtr4di 2282 1 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2202  Vcvv 2803   × cxp 4729  ran crn 4732  cfv 5333  (class class class)co 6028  cmpo 6030  topGenctg 13417   ×t ctx 15063
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-topgen 13423  df-tx 15064
This theorem is referenced by:  eltx  15070  txtop  15071  txtopon  15073  txopn  15076  txss12  15077  txbasval  15078  txcnp  15082  txcnmpt  15084  txrest  15087  txlm  15090  xmettxlem  15320  xmettx  15321
  Copyright terms: Public domain W3C validator