Theorem sorpsscmpl 7679

Description: The componentwise complement of a chain of sets is also a chain of sets. (Contributed by Stefan O'Rear, 2-Nov-2014.)

Assertion

Ref	Expression
sorpsscmpl	⊢ ( [⊊] Or 𝑌 → [⊊] Or {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌})

Distinct variable groups:   𝑢,𝑌   𝑢,𝐴

Proof of Theorem sorpsscmpl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difeq2 4072	. . . . . . 7 ⊢ (𝑢 = 𝑥 → (𝐴 ∖ 𝑢) = (𝐴 ∖ 𝑥))
2	1	eleq1d 2821	. . . . . 6 ⊢ (𝑢 = 𝑥 → ((𝐴 ∖ 𝑢) ∈ 𝑌 ↔ (𝐴 ∖ 𝑥) ∈ 𝑌))
3	2	elrab 3646	. . . . 5 ⊢ (𝑥 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} ↔ (𝑥 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝑌))
4		difeq2 4072	. . . . . . 7 ⊢ (𝑢 = 𝑦 → (𝐴 ∖ 𝑢) = (𝐴 ∖ 𝑦))
5	4	eleq1d 2821	. . . . . 6 ⊢ (𝑢 = 𝑦 → ((𝐴 ∖ 𝑢) ∈ 𝑌 ↔ (𝐴 ∖ 𝑦) ∈ 𝑌))
6	5	elrab 3646	. . . . 5 ⊢ (𝑦 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} ↔ (𝑦 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌))
7		an4 656	. . . . . 6 ⊢ (((𝑥 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝑌) ∧ (𝑦 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) ∧ ((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)))
8	7	biimpi 216	. . . . 5 ⊢ (((𝑥 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑥) ∈ 𝑌) ∧ (𝑦 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)) → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) ∧ ((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)))
9	3, 6, 8	syl2anb 598	. . . 4 ⊢ ((𝑥 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} ∧ 𝑦 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌}) → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) ∧ ((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)))
10		sorpssi 7674	. . . . . . . 8 ⊢ (( [⊊] Or 𝑌 ∧ ((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)) → ((𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦) ∨ (𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥)))
11	10	expcom 413	. . . . . . 7 ⊢ (((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌) → ( [⊊] Or 𝑌 → ((𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦) ∨ (𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥))))
12		velpw 4559	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
13		dfss4 4221	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥)
14	12, 13	bitri 275	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥)
15		velpw 4559	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴)
16		dfss4 4221	. . . . . . . . . . 11 ⊢ (𝑦 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦)
17	15, 16	bitri 275	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦)
18		sscon 4095	. . . . . . . . . . . 12 ⊢ ((𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥) → (𝐴 ∖ (𝐴 ∖ 𝑥)) ⊆ (𝐴 ∖ (𝐴 ∖ 𝑦)))
19		sseq12 3961	. . . . . . . . . . . 12 ⊢ (((𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥 ∧ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦) → ((𝐴 ∖ (𝐴 ∖ 𝑥)) ⊆ (𝐴 ∖ (𝐴 ∖ 𝑦)) ↔ 𝑥 ⊆ 𝑦))
20	18, 19	imbitrid 244	. . . . . . . . . . 11 ⊢ (((𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥 ∧ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦) → ((𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥) → 𝑥 ⊆ 𝑦))
21		sscon 4095	. . . . . . . . . . . 12 ⊢ ((𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦) → (𝐴 ∖ (𝐴 ∖ 𝑦)) ⊆ (𝐴 ∖ (𝐴 ∖ 𝑥)))
22		sseq12 3961	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦 ∧ (𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥) → ((𝐴 ∖ (𝐴 ∖ 𝑦)) ⊆ (𝐴 ∖ (𝐴 ∖ 𝑥)) ↔ 𝑦 ⊆ 𝑥))
23	22	ancoms 458	. . . . . . . . . . . 12 ⊢ (((𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥 ∧ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦) → ((𝐴 ∖ (𝐴 ∖ 𝑦)) ⊆ (𝐴 ∖ (𝐴 ∖ 𝑥)) ↔ 𝑦 ⊆ 𝑥))
24	21, 23	imbitrid 244	. . . . . . . . . . 11 ⊢ (((𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥 ∧ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦) → ((𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦) → 𝑦 ⊆ 𝑥))
25	20, 24	orim12d 966	. . . . . . . . . 10 ⊢ (((𝐴 ∖ (𝐴 ∖ 𝑥)) = 𝑥 ∧ (𝐴 ∖ (𝐴 ∖ 𝑦)) = 𝑦) → (((𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥) ∨ (𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦)) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)))
26	14, 17, 25	syl2anb 598	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) → (((𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥) ∨ (𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦)) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)))
27	26	com12 32	. . . . . . . 8 ⊢ (((𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥) ∨ (𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦)) → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)))
28	27	orcoms 872	. . . . . . 7 ⊢ (((𝐴 ∖ 𝑥) ⊆ (𝐴 ∖ 𝑦) ∨ (𝐴 ∖ 𝑦) ⊆ (𝐴 ∖ 𝑥)) → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)))
29	11, 28	syl6 35	. . . . . 6 ⊢ (((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌) → ( [⊊] Or 𝑌 → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))))
30	29	com3l 89	. . . . 5 ⊢ ( [⊊] Or 𝑌 → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) → (((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))))
31	30	impd 410	. . . 4 ⊢ ( [⊊] Or 𝑌 → (((𝑥 ∈ 𝒫 𝐴 ∧ 𝑦 ∈ 𝒫 𝐴) ∧ ((𝐴 ∖ 𝑥) ∈ 𝑌 ∧ (𝐴 ∖ 𝑦) ∈ 𝑌)) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)))
32	9, 31	syl5 34	. . 3 ⊢ ( [⊊] Or 𝑌 → ((𝑥 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} ∧ 𝑦 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌}) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)))
33	32	ralrimivv 3177	. 2 ⊢ ( [⊊] Or 𝑌 → ∀𝑥 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌}∀𝑦 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))
34		sorpss 7673	. 2 ⊢ ( [⊊] Or {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} ↔ ∀𝑥 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌}∀𝑦 ∈ {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌} (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))
35	33, 34	sylibr 234	1 ⊢ ( [⊊] Or 𝑌 → [⊊] Or {𝑢 ∈ 𝒫 𝐴 ∣ (𝐴 ∖ 𝑢) ∈ 𝑌})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1541   ∈ wcel 2113  ∀wral 3051  {crab 3399   ∖ cdif 3898   ⊆ wss 3901  𝒫 cpw 4554   Or wor 5531   [⊊] crpss 7667

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-rpss 7668

This theorem is referenced by:  fin2i2  10230  isfin2-2  10231