Theorem ssunsn2 4788

Description: The property of being sandwiched between two sets naturally splits under union with a singleton. This is the induction hypothesis for the determination of large powersets such as pwtp 4862. (Contributed by Mario Carneiro, 2-Jul-2016.)

Assertion

Ref	Expression
ssunsn2	⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷}))))

Proof of Theorem ssunsn2

Step	Hyp	Ref	Expression
1		snssi 4747	. . . . 5 ⊢ (𝐷 ∈ 𝐴 → {𝐷} ⊆ 𝐴)
2		unss 4145	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ {𝐷} ⊆ 𝐴) ↔ (𝐵 ∪ {𝐷}) ⊆ 𝐴)
3	2	bicomi 227	. . . . . 6 ⊢ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ {𝐷} ⊆ 𝐴))
4	3	rbaibr 546	. . . . 5 ⊢ ({𝐷} ⊆ 𝐴 → (𝐵 ⊆ 𝐴 ↔ (𝐵 ∪ {𝐷}) ⊆ 𝐴))
5	1, 4	syl 18	. . . 4 ⊢ (𝐷 ∈ 𝐴 → (𝐵 ⊆ 𝐴 ↔ (𝐵 ∪ {𝐷}) ⊆ 𝐴))
6	5	anbi1d 642	. . 3 ⊢ (𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷}))))
7	2	biimpi 219	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ {𝐷} ⊆ 𝐴) → (𝐵 ∪ {𝐷}) ⊆ 𝐴)
8	7	expcom 418	. . . . . 6 ⊢ ({𝐷} ⊆ 𝐴 → (𝐵 ⊆ 𝐴 → (𝐵 ∪ {𝐷}) ⊆ 𝐴))
9	1, 8	syl 18	. . . . 5 ⊢ (𝐷 ∈ 𝐴 → (𝐵 ⊆ 𝐴 → (𝐵 ∪ {𝐷}) ⊆ 𝐴))
10		ssun3 4135	. . . . . 6 ⊢ (𝐴 ⊆ 𝐶 → 𝐴 ⊆ (𝐶 ∪ {𝐷}))
11	10	a1i 11	. . . . 5 ⊢ (𝐷 ∈ 𝐴 → (𝐴 ⊆ 𝐶 → 𝐴 ⊆ (𝐶 ∪ {𝐷})))
12	9, 11	anim12d 620	. . . 4 ⊢ (𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) → ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷}))))
13		pm4.72 964	. . . 4 ⊢ (((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) → ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷}))) ↔ (((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})))))
14	12, 13	sylib 221	. . 3 ⊢ (𝐷 ∈ 𝐴 → (((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})))))
15	6, 14	bitrd 282	. 2 ⊢ (𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})))))
16		uncom 4114	. . . . . . 7 ⊢ ({𝐷} ∪ 𝐶) = (𝐶 ∪ {𝐷})
17	16	sseq2i 3968	. . . . . 6 ⊢ (𝐴 ⊆ ({𝐷} ∪ 𝐶) ↔ 𝐴 ⊆ (𝐶 ∪ {𝐷}))
18		ssundif 4444	. . . . . 6 ⊢ (𝐴 ⊆ ({𝐷} ∪ 𝐶) ↔ (𝐴 ∖ {𝐷}) ⊆ 𝐶)
19	17, 18	bitr3i 280	. . . . 5 ⊢ (𝐴 ⊆ (𝐶 ∪ {𝐷}) ↔ (𝐴 ∖ {𝐷}) ⊆ 𝐶)
20		disjsn 4673	. . . . . . 7 ⊢ ((𝐴 ∩ {𝐷}) = ∅ ↔ ¬ 𝐷 ∈ 𝐴)
21		disj3 4411	. . . . . . 7 ⊢ ((𝐴 ∩ {𝐷}) = ∅ ↔ 𝐴 = (𝐴 ∖ {𝐷}))
22	20, 21	bitr3i 280	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐴 ↔ 𝐴 = (𝐴 ∖ {𝐷}))
23		sseq1 3964	. . . . . 6 ⊢ (𝐴 = (𝐴 ∖ {𝐷}) → (𝐴 ⊆ 𝐶 ↔ (𝐴 ∖ {𝐷}) ⊆ 𝐶))
24	22, 23	sylbi 220	. . . . 5 ⊢ (¬ 𝐷 ∈ 𝐴 → (𝐴 ⊆ 𝐶 ↔ (𝐴 ∖ {𝐷}) ⊆ 𝐶))
25	19, 24	bitr4id 293	. . . 4 ⊢ (¬ 𝐷 ∈ 𝐴 → (𝐴 ⊆ (𝐶 ∪ {𝐷}) ↔ 𝐴 ⊆ 𝐶))
26	25	anbi2d 641	. . 3 ⊢ (¬ 𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ (𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶)))
27	3	simplbi 501	. . . . . . 7 ⊢ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 → 𝐵 ⊆ 𝐴)
28	27	a1i 11	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐴 → ((𝐵 ∪ {𝐷}) ⊆ 𝐴 → 𝐵 ⊆ 𝐴))
29	25	biimpd 232	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐴 → (𝐴 ⊆ (𝐶 ∪ {𝐷}) → 𝐴 ⊆ 𝐶))
30	28, 29	anim12d 620	. . . . 5 ⊢ (¬ 𝐷 ∈ 𝐴 → (((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) → (𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶)))
31		pm4.72 964	. . . . 5 ⊢ ((((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) → (𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶)) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ↔ (((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ∨ (𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶))))
32	30, 31	sylib 221	. . . 4 ⊢ (¬ 𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ↔ (((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ∨ (𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶))))
33		orcom 883	. . . 4 ⊢ ((((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ∨ (𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶)) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷}))))
34	32, 33	bitrdi 290	. . 3 ⊢ (¬ 𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})))))
35	26, 34	bitrd 282	. 2 ⊢ (¬ 𝐷 ∈ 𝐴 → ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})))))
36	15, 35	pm2.61i 184	1 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷})) ↔ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐶) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴 ∧ 𝐴 ⊆ (𝐶 ∪ {𝐷}))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1563   ∈ wcel 2145   ∖ cdif 3904   ∪ cun 3905   ∩ cin 3906   ⊆ wss 3907  ∅c0 4288  {csn 4585

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

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-sn 4586

This theorem is referenced by:  ssunsn  4789  ssunpr  4794  sstp  4796