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

Theorem txss12 14980
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 2229 . . . 4 ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) = ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))
21txbasex 14971 . . 3 ((𝐵𝑉𝐷𝑊) → ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3 resmpo 6114 . . . . . 6 ((𝐴𝐵𝐶𝐷) → ((𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)))
4 resss 5035 . . . . . 6 ((𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))
53, 4eqsstrrdi 3278 . . . . 5 ((𝐴𝐵𝐶𝐷) → (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
65adantl 277 . . . 4 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
7 rnss 4960 . . . 4 ((𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
86, 7syl 14 . . 3 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
9 tgss 14777 . . 3 ((ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
102, 8, 9syl2an2r 597 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
11 ssexg 4226 . . . . 5 ((𝐴𝐵𝐵𝑉) → 𝐴 ∈ V)
12 ssexg 4226 . . . . 5 ((𝐶𝐷𝐷𝑊) → 𝐶 ∈ V)
13 eqid 2229 . . . . . 6 ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))
1413txval 14969 . . . . 5 ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1511, 12, 14syl2an 289 . . . 4 (((𝐴𝐵𝐵𝑉) ∧ (𝐶𝐷𝐷𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1615an4s 590 . . 3 (((𝐴𝐵𝐶𝐷) ∧ (𝐵𝑉𝐷𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1716ancoms 268 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
181txval 14969 . . 3 ((𝐵𝑉𝐷𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
1918adantr 276 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
2010, 17, 193sstr4d 3270 1 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  Vcvv 2800  wss 3198   × cxp 4721  ran crn 4724  cres 4725  cfv 5324  (class class class)co 6013  cmpo 6015  topGenctg 13327   ×t ctx 14966
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-topgen 13333  df-tx 14967
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator