Theorem txss12 23832

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 23793	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V)
3		resmpo 7536	. . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)))
4		resss 5998	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ↾ (𝐴 × 𝐶)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))
5	3, 4	eqsstrrdi 3979	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
6	5	adantl 487	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
7		rnss 5927	. . . 4 ⊢ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
8	6, 7	syl 18	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)))
9		tgss 23194	. . 3 ⊢ ((ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦)) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) ⊆ ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
10	2, 8, 9	syl2an2r 698	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (topGen‘ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))) ⊆ (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
11		ssexg 5288	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V)
12		ssexg 5288	. . . . 5 ⊢ ((𝐶 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊) → 𝐶 ∈ V)
13		eqid 2762	. . . . . 6 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ (𝑥 × 𝑦))
14	13	txval 23791	. . . . 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 23791	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
19	18	adantr 486	. 2 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐵 ×t 𝐷) = (topGen‘ran (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐷 ↦ (𝑥 × 𝑦))))
20	10, 17, 19	3sstr4d 3989	1 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) ∧ (𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷)) → (𝐴 ×t 𝐶) ⊆ (𝐵 ×t 𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902   × cxp 5657  ran crn 5660   ↾ cres 5661  ‘cfv 6537  (class class class)co 7416   ∈ cmpo 7418  topGenctg 17526   ×_t ctx 23787

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 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 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-topgen 17532  df-tx 23789

This theorem is used by: (None)