Theorem txss12 23951

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 2763	. . . 4 ⊢ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
2	1	txbasex 23912	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3		resmpo 7560	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)))
4		resss 6002	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
5	3, 4	eqsstrrdi 3958	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
6	5	adantl 487	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
7		rnss 5927	. . . 4 ⊢ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
8	6, 7	syl 18	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
9		tgss 23313	. . 3 ⊢ ((ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
10	2, 8, 9	syl2an2r 698	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
11		ssexg 5285	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V)
12		ssexg 5285	. . . . 5 ⊢ ((𝐶 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊) → 𝐶 ∈ V)
13		eqid 2763	. . . . . 6 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))
14	13	txval 23910	. . . . 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 23910	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
19	18	adantr 486	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
20	10, 17, 19	3sstr4d 3968	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   × cxp 5653  ran crn 5656   ↾ cres 5657  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  topGenctg 17634   ×_t ctx 23906

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-topgen 17640  df-tx 23908

This theorem is used by: (None)