Theorem ustund 24336

Description: If two intersecting sets 𝐴 and 𝐵 are both small in 𝑉, their union is small in (𝑉↑2). Proposition 1 of [BourbakiTop1] p. II.12. This proposition actually does not require any axiom of the definition of uniform structures. (Contributed by Thierry Arnoux, 17-Nov-2017.)

Hypotheses

Ref	Expression
ustund.1	⊢ (𝜑 → (𝐴 × 𝐴) ⊆ 𝑉)
ustund.2	⊢ (𝜑 → (𝐵 × 𝐵) ⊆ 𝑉)
ustund.3	⊢ (𝜑 → (𝐴 ∩ 𝐵) ≠ ∅)

Assertion

Ref	Expression
ustund	⊢ (𝜑 → ((𝐴 ∪ 𝐵) × (𝐴 ∪ 𝐵)) ⊆ (𝑉 ∘ 𝑉))

Proof of Theorem ustund

Step	Hyp	Ref	Expression
1		ustund.3	. . 3 ⊢ (𝜑 → (𝐴 ∩ 𝐵) ≠ ∅)
2		xpco 6279	. . 3 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ → (((𝐴 ∩ 𝐵) × (𝐴 ∪ 𝐵)) ∘ ((𝐴 ∪ 𝐵) × (𝐴 ∩ 𝐵))) = ((𝐴 ∪ 𝐵) × (𝐴 ∪ 𝐵)))
3	1, 2	syl 18	. 2 ⊢ (𝜑 → (((𝐴 ∩ 𝐵) × (𝐴 ∪ 𝐵)) ∘ ((𝐴 ∪ 𝐵) × (𝐴 ∩ 𝐵))) = ((𝐴 ∪ 𝐵) × (𝐴 ∪ 𝐵)))
4		xpundi 5720	. . . 4 ⊢ ((𝐴 ∩ 𝐵) × (𝐴 ∪ 𝐵)) = (((𝐴 ∩ 𝐵) × 𝐴) ∪ ((𝐴 ∩ 𝐵) × 𝐵))
5		xpindir 5810	. . . . . 6 ⊢ ((𝐴 ∩ 𝐵) × 𝐴) = ((𝐴 × 𝐴) ∩ (𝐵 × 𝐴))
6		inss1 4191	. . . . . . 7 ⊢ ((𝐴 × 𝐴) ∩ (𝐵 × 𝐴)) ⊆ (𝐴 × 𝐴)
7		ustund.1	. . . . . . 7 ⊢ (𝜑 → (𝐴 × 𝐴) ⊆ 𝑉)
8	6, 7	sstrid 3950	. . . . . 6 ⊢ (𝜑 → ((𝐴 × 𝐴) ∩ (𝐵 × 𝐴)) ⊆ 𝑉)
9	5, 8	eqsstrid 3977	. . . . 5 ⊢ (𝜑 → ((𝐴 ∩ 𝐵) × 𝐴) ⊆ 𝑉)
10		xpindir 5810	. . . . . 6 ⊢ ((𝐴 ∩ 𝐵) × 𝐵) = ((𝐴 × 𝐵) ∩ (𝐵 × 𝐵))
11		inss2 4192	. . . . . . 7 ⊢ ((𝐴 × 𝐵) ∩ (𝐵 × 𝐵)) ⊆ (𝐵 × 𝐵)
12		ustund.2	. . . . . . 7 ⊢ (𝜑 → (𝐵 × 𝐵) ⊆ 𝑉)
13	11, 12	sstrid 3950	. . . . . 6 ⊢ (𝜑 → ((𝐴 × 𝐵) ∩ (𝐵 × 𝐵)) ⊆ 𝑉)
14	10, 13	eqsstrid 3977	. . . . 5 ⊢ (𝜑 → ((𝐴 ∩ 𝐵) × 𝐵) ⊆ 𝑉)
15	9, 14	unssd 4147	. . . 4 ⊢ (𝜑 → (((𝐴 ∩ 𝐵) × 𝐴) ∪ ((𝐴 ∩ 𝐵) × 𝐵)) ⊆ 𝑉)
16	4, 15	eqsstrid 3977	. . 3 ⊢ (𝜑 → ((𝐴 ∩ 𝐵) × (𝐴 ∪ 𝐵)) ⊆ 𝑉)
17		xpundir 5721	. . . 4 ⊢ ((𝐴 ∪ 𝐵) × (𝐴 ∩ 𝐵)) = ((𝐴 × (𝐴 ∩ 𝐵)) ∪ (𝐵 × (𝐴 ∩ 𝐵)))
18		xpindi 5809	. . . . . 6 ⊢ (𝐴 × (𝐴 ∩ 𝐵)) = ((𝐴 × 𝐴) ∩ (𝐴 × 𝐵))
19		inss1 4191	. . . . . . 7 ⊢ ((𝐴 × 𝐴) ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐴)
20	19, 7	sstrid 3950	. . . . . 6 ⊢ (𝜑 → ((𝐴 × 𝐴) ∩ (𝐴 × 𝐵)) ⊆ 𝑉)
21	18, 20	eqsstrid 3977	. . . . 5 ⊢ (𝜑 → (𝐴 × (𝐴 ∩ 𝐵)) ⊆ 𝑉)
22		xpindi 5809	. . . . . 6 ⊢ (𝐵 × (𝐴 ∩ 𝐵)) = ((𝐵 × 𝐴) ∩ (𝐵 × 𝐵))
23		inss2 4192	. . . . . . 7 ⊢ ((𝐵 × 𝐴) ∩ (𝐵 × 𝐵)) ⊆ (𝐵 × 𝐵)
24	23, 12	sstrid 3950	. . . . . 6 ⊢ (𝜑 → ((𝐵 × 𝐴) ∩ (𝐵 × 𝐵)) ⊆ 𝑉)
25	22, 24	eqsstrid 3977	. . . . 5 ⊢ (𝜑 → (𝐵 × (𝐴 ∩ 𝐵)) ⊆ 𝑉)
26	21, 25	unssd 4147	. . . 4 ⊢ (𝜑 → ((𝐴 × (𝐴 ∩ 𝐵)) ∪ (𝐵 × (𝐴 ∩ 𝐵))) ⊆ 𝑉)
27	17, 26	eqsstrid 3977	. . 3 ⊢ (𝜑 → ((𝐴 ∪ 𝐵) × (𝐴 ∩ 𝐵)) ⊆ 𝑉)
28	16, 27	coss12d 14997	. 2 ⊢ (𝜑 → (((𝐴 ∩ 𝐵) × (𝐴 ∪ 𝐵)) ∘ ((𝐴 ∪ 𝐵) × (𝐴 ∩ 𝐵))) ⊆ (𝑉 ∘ 𝑉))
29	3, 28	eqsstrrd 3974	1 ⊢ (𝜑 → ((𝐴 ∪ 𝐵) × (𝐴 ∪ 𝐵)) ⊆ (𝑉 ∘ 𝑉))

Syntax hints:   → wi 4   = wceq 1563   ≠ wne 2960   ∪ cun 3905   ∩ cin 3906   ⊆ wss 3907  ∅c0 4288   × cxp 5649   ∘ ccom 5655

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5250  ax-pr 5394

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5105  df-opab 5167  df-xp 5657  df-rel 5658  df-co 5660

This theorem is referenced by: (None)