Theorem txss12 23885

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.

Step	Hyp	Ref	Expression
1		eqid 2760	. . . 4 ⊢ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
2	1	txbasex 23846	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3		resmpo 7528	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)))
4		resss 5988	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
5	3, 4	eqsstrrdi 3975	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
6	5	adantl 487	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
7		rnss 5917	. . . 4 ⊢ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
8	6, 7	syl 18	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
9		tgss 23247	. . 3 ⊢ ((ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
10	2, 8, 9	syl2an2r 698	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
11		ssexg 5280	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V)
12		ssexg 5280	. . . . 5 ⊢ ((𝐶 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊) → 𝐶 ∈ V)
13		eqid 2760	. . . . . 6 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))
14	13	txval 23844	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
15	11, 12, 14	syl2an 608	. . . 4 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
16	15	an4s 673	. . 3 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) ∧ (𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
17	16	ancoms 464	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
18	1	txval 23844	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
19	18	adantr 486	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
20	10, 17, 19	3sstr4d 3985	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3898   × cxp 5645  ran crn 5648   ↾ cres 5649  ‘cfv 6527  (class class class)co 7408   ∈ cmpo 7410  topGenctg 17569   ×_t ctx 23840

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-topgen 17575  df-tx 23842

This theorem is used by: (None)