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

Theorem txss12 14853
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 2207 . . . 4 ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) = ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))
21txbasex 14844 . . 3 ((𝐵𝑉𝐷𝑊) → ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3 resmpo 6066 . . . . . 6 ((𝐴𝐵𝐶𝐷) → ((𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)))
4 resss 5002 . . . . . 6 ((𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))
53, 4eqsstrrdi 3254 . . . . 5 ((𝐴𝐵𝐶𝐷) → (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
65adantl 277 . . . 4 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
7 rnss 4927 . . . 4 ((𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
86, 7syl 14 . . 3 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)))
9 tgss 14650 . . 3 ((ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
102, 8, 9syl2an2r 595 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
11 ssexg 4199 . . . . 5 ((𝐴𝐵𝐵𝑉) → 𝐴 ∈ V)
12 ssexg 4199 . . . . 5 ((𝐶𝐷𝐷𝑊) → 𝐶 ∈ V)
13 eqid 2207 . . . . . 6 ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))
1413txval 14842 . . . . 5 ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1511, 12, 14syl2an 289 . . . 4 (((𝐴𝐵𝐵𝑉) ∧ (𝐶𝐷𝐷𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1615an4s 588 . . 3 (((𝐴𝐵𝐶𝐷) ∧ (𝐵𝑉𝐷𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
1716ancoms 268 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥𝐴, 𝑦𝐶 ↦ (𝑥 × 𝑦))))
181txval 14842 . . 3 ((𝐵𝑉𝐷𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
1918adantr 276 . 2 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥𝐵, 𝑦𝐷 ↦ (𝑥 × 𝑦))))
2010, 17, 193sstr4d 3246 1 (((𝐵𝑉𝐷𝑊) ∧ (𝐴𝐵𝐶𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wcel 2178  Vcvv 2776  wss 3174   × cxp 4691  ran crn 4694  cres 4695  cfv 5290  (class class class)co 5967  cmpo 5969  topGenctg 13201   ×t ctx 14839
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-topgen 13207  df-tx 14840
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator