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

Theorem txss12 15131
Description: Subset property of the topological product. (Contributed by Mario Carneiro, 2-Sep-2015.)
Assertion
Ref Expression
txss12 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))

Proof of Theorem txss12
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2232 . . . 4 ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) = ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))
21txbasex 15122 . . 3 ((𝐵𝑉𝐷𝑊) → ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3 resmpo 6151 . . . . . 6 ((𝐴𝐵𝐶𝐷) → ((𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)))
4 resss 5062 . . . . . 6 ((𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))
53, 4eqsstrrdi 3291 . . . . 5 ((𝐴𝐵𝐶𝐷) → (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
65adantl 277 . . . 4 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
7 rnss 4987 . . . 4 ((𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
86, 7syl 14 . . 3 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
9 tgss 14928 . . 3 ((ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
102, 8, 9syl2an2r 599 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
11 ssexg 4249 . . . . 5 ((𝐴𝐵𝐵𝑉) → 𝐴 ∈ V)
12 ssexg 4249 . . . . 5 ((𝐶𝐷𝐷𝑊) → 𝐶 ∈ V)
13 eqid 2232 . . . . . 6 ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))
1413txval 15120 . . . . 5 ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1511, 12, 14syl2an 289 . . . 4 (((𝐴𝐵𝐵𝑉) ∧ (𝐶𝐷𝐷𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1615an4s 592 . . 3 (((𝐴𝐵𝐶𝐷) ∧ (𝐵𝑉𝐷𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1716ancoms 268 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
181txval 15120 . . 3 ((𝐵𝑉𝐷𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
1918adantr 276 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
2010, 17, 193sstr4d 3283 1 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  Vcvv 2813  wss 3211   × cxp 4747  ran crn 4750  cres 4751  cfv 5352  (class class class)co 6050  cmpo 6052  topGenctg 13467   ×t ctx 15117
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-topgen 13473  df-tx 15118
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator