Theorem txss12 23773

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 2762	. . . 4 ⊢ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
2	1	txbasex 23734	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3		resmpo 7532	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)))
4		resss 5999	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
5	3, 4	eqsstrrdi 3981	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
6	5	adantl 486	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
7		rnss 5928	. . . 4 ⊢ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
8	6, 7	syl 18	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
9		tgss 23136	. . 3 ⊢ ((ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
10	2, 8, 9	syl2an2r 697	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
11		ssexg 5289	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V)
12		ssexg 5289	. . . . 5 ⊢ ((𝐶 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊) → 𝐶 ∈ V)
13		eqid 2762	. . . . . 6 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))
14	13	txval 23732	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
15	11, 12, 14	syl2an 607	. . . 4 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
16	15	an4s 672	. . 3 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) ∧ (𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
17	16	ancoms 463	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐴 ×t 𝐶) = (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))))
18	1	txval 23732	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
19	18	adantr 485	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
20	10, 17, 19	3sstr4d 3991	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  Vcvv 3454   ⊆ wss 3904   × cxp 5658  ran crn 5661   ↾ cres 5662  ‘cfv 6536  (class class class)co 7412   ∈ cmpo 7414  topGenctg 17496   ×_t ctx 23728

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-topgen 17502  df-tx 23730

This theorem is used by: (None)