Theorem topdifinfeq 37316

Description: Two different ways of defining the collection from Exercise 3 of [Munkres] p. 83. (Contributed by ML, 18-Jul-2020.)

Assertion

Ref	Expression
topdifinfeq	⊢ {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ ((𝐴 ∖ 𝑥) = ∅ ∨ (𝐴 ∖ 𝑥) = 𝐴))} = {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))}

Distinct variable group:   𝑥,𝐴

Proof of Theorem topdifinfeq

Step	Hyp	Ref	Expression
1		velpw 4627	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
2		sseqin2 4244	. . . . . . . . 9 ⊢ (𝑥 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑥) = 𝑥)
3	1, 2	bitri 275	. . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ (𝐴 ∩ 𝑥) = 𝑥)
4		eqeq1 2744	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝑥) = 𝑥 → ((𝐴 ∩ 𝑥) = ∅ ↔ 𝑥 = ∅))
5	3, 4	sylbi 217	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝐴 → ((𝐴 ∩ 𝑥) = ∅ ↔ 𝑥 = ∅))
6		disj3 4477	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝑥) = ∅ ↔ 𝐴 = (𝐴 ∖ 𝑥))
7		eqcom 2747	. . . . . . . 8 ⊢ (𝐴 = (𝐴 ∖ 𝑥) ↔ (𝐴 ∖ 𝑥) = 𝐴)
8	6, 7	bitri 275	. . . . . . 7 ⊢ ((𝐴 ∩ 𝑥) = ∅ ↔ (𝐴 ∖ 𝑥) = 𝐴)
9	5, 8	bitr3di 286	. . . . . 6 ⊢ (𝑥 ∈ 𝒫 𝐴 → (𝑥 = ∅ ↔ (𝐴 ∖ 𝑥) = 𝐴))
10		eqss 4024	. . . . . . . 8 ⊢ (𝑥 = 𝐴 ↔ (𝑥 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝑥))
11		ssdif0 4389	. . . . . . . . . 10 ⊢ (𝐴 ⊆ 𝑥 ↔ (𝐴 ∖ 𝑥) = ∅)
12	11	bicomi 224	. . . . . . . . 9 ⊢ ((𝐴 ∖ 𝑥) = ∅ ↔ 𝐴 ⊆ 𝑥)
13	1, 12	anbi12i 627	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑥) = ∅) ↔ (𝑥 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝑥))
14	10, 13	bitr4i 278	. . . . . . 7 ⊢ (𝑥 = 𝐴 ↔ (𝑥 ∈ 𝒫 𝐴 ∧ (𝐴 ∖ 𝑥) = ∅))
15	14	baib 535	. . . . . 6 ⊢ (𝑥 ∈ 𝒫 𝐴 → (𝑥 = 𝐴 ↔ (𝐴 ∖ 𝑥) = ∅))
16	9, 15	orbi12d 917	. . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 → ((𝑥 = ∅ ∨ 𝑥 = 𝐴) ↔ ((𝐴 ∖ 𝑥) = 𝐴 ∨ (𝐴 ∖ 𝑥) = ∅)))
17		orcom 869	. . . . 5 ⊢ (((𝐴 ∖ 𝑥) = 𝐴 ∨ (𝐴 ∖ 𝑥) = ∅) ↔ ((𝐴 ∖ 𝑥) = ∅ ∨ (𝐴 ∖ 𝑥) = 𝐴))
18	16, 17	bitrdi 287	. . . 4 ⊢ (𝑥 ∈ 𝒫 𝐴 → ((𝑥 = ∅ ∨ 𝑥 = 𝐴) ↔ ((𝐴 ∖ 𝑥) = ∅ ∨ (𝐴 ∖ 𝑥) = 𝐴)))
19	18	orbi2d 914	. . 3 ⊢ (𝑥 ∈ 𝒫 𝐴 → ((¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) ↔ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ ((𝐴 ∖ 𝑥) = ∅ ∨ (𝐴 ∖ 𝑥) = 𝐴))))
20	19	bicomd 223	. 2 ⊢ (𝑥 ∈ 𝒫 𝐴 → ((¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ ((𝐴 ∖ 𝑥) = ∅ ∨ (𝐴 ∖ 𝑥) = 𝐴)) ↔ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))))
21	20	rabbiia 3447	1 ⊢ {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ ((𝐴 ∖ 𝑥) = ∅ ∨ (𝐴 ∖ 𝑥) = 𝐴))} = {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))}

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   ∨ wo 846   = wceq 1537   ∈ wcel 2108  {crab 3443   ∖ cdif 3973   ∩ cin 3975   ⊆ wss 3976  ∅c0 4352  𝒫 cpw 4622  Fincfn 9003

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rab 3444  df-v 3490  df-dif 3979  df-in 3983  df-ss 3993  df-nul 4353  df-pw 4624

This theorem is referenced by: (None)