Theorem dissneqlem 38243

Description: This is the core of the proof of dissneq 38244, but to avoid the distinct variables on the definitions, we split this proof into two. (Contributed by ML, 16-Jul-2020.)

Hypothesis

Ref	Expression
dissneq.c	⊢ 𝐶 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}

Assertion

Ref	Expression
dissneqlem	⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → 𝐵 = 𝒫 𝐴)

Distinct variable groups:   𝑢,𝐴,𝑥   𝑥,𝐵   𝑥,𝐶

Allowed substitution hints:   𝐵(𝑢)   𝐶(𝑢)

Proof of Theorem dissneqlem

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

Step	Hyp	Ref	Expression
1		topgele 23241	. . . 4 ⊢ (𝐵 ∈ (TopOn‘𝐴) → ({∅, 𝐴} ⊆ 𝐵 ∧ 𝐵 ⊆ 𝒫 𝐴))
2	1	adantl 487	. . 3 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → ({∅, 𝐴} ⊆ 𝐵 ∧ 𝐵 ⊆ 𝒫 𝐴))
3	2	simprd 501	. 2 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → 𝐵 ⊆ 𝒫 𝐴)
4		velpw 4562	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
5		simp3 1156	. . . . . . . . . 10 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → 𝐵 ∈ (TopOn‘𝐴))
6		df-ima 5664	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑧 ∈ 𝐴 ↦ {𝑧}) “ 𝑥) = ran ((𝑧 ∈ 𝐴 ↦ {𝑧}) ↾ 𝑥)
7		resmpt 6029	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ⊆ 𝐴 → ((𝑧 ∈ 𝐴 ↦ {𝑧}) ↾ 𝑥) = (𝑧 ∈ 𝑥 ↦ {𝑧}))
8	7	rneqd 5920	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ⊆ 𝐴 → ran ((𝑧 ∈ 𝐴 ↦ {𝑧}) ↾ 𝑥) = ran (𝑧 ∈ 𝑥 ↦ {𝑧}))
9	6, 8	eqtrid 2808	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ⊆ 𝐴 → ((𝑧 ∈ 𝐴 ↦ {𝑧}) “ 𝑥) = ran (𝑧 ∈ 𝑥 ↦ {𝑧}))
10		rnmptsn 38238	. . . . . . . . . . . . . . . . 17 ⊢ ran (𝑧 ∈ 𝑥 ↦ {𝑧}) = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}}
11	9, 10	eqtrdi 2812	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ⊆ 𝐴 → ((𝑧 ∈ 𝐴 ↦ {𝑧}) “ 𝑥) = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
12		imassrn 6196	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ 𝐴 ↦ {𝑧}) “ 𝑥) ⊆ ran (𝑧 ∈ 𝐴 ↦ {𝑧})
13	11, 12	eqsstrrdi 3976	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ⊆ 𝐴 → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ ran (𝑧 ∈ 𝐴 ↦ {𝑧}))
14		rnmptsn 38238	. . . . . . . . . . . . . . 15 ⊢ ran (𝑧 ∈ 𝐴 ↦ {𝑧}) = {𝑢 ∣ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧}}
15	13, 14	sseqtrdi 3971	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ 𝐴 → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ {𝑢 ∣ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧}})
16		dissneq.c	. . . . . . . . . . . . . . 15 ⊢ 𝐶 = {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}}
17		sneq 4594	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
18	17	eqeq2d 2772	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → (𝑢 = {𝑥} ↔ 𝑢 = {𝑧}))
19	18	cbvrexvw 3242	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑥 ∈ 𝐴 𝑢 = {𝑥} ↔ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧})
20	19	abbii 2828	. . . . . . . . . . . . . . 15 ⊢ {𝑢 ∣ ∃𝑥 ∈ 𝐴 𝑢 = {𝑥}} = {𝑢 ∣ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧}}
21	16, 20	eqtri 2784	. . . . . . . . . . . . . 14 ⊢ 𝐶 = {𝑢 ∣ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧}}
22	15, 21	sseqtrrdi 3972	. . . . . . . . . . . . 13 ⊢ (𝑥 ⊆ 𝐴 → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐶)
23	22	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐶)
24		sstr 3939	. . . . . . . . . . . . . 14 ⊢ (({𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵)
25	24	expcom 419	. . . . . . . . . . . . 13 ⊢ (𝐶 ⊆ 𝐵 → ({𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐶 → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵))
26	25	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → ({𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐶 → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵))
27	23, 26	mpd 16	. . . . . . . . . . 11 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵)
28	27	3adant3 1150	. . . . . . . . . 10 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵)
29	5, 28	ssexd 5286	. . . . . . . . 9 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ∈ V)
30		isset 3465	. . . . . . . . 9 ⊢ ({𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ∈ V ↔ ∃𝑦 𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
31	29, 30	sylib 221	. . . . . . . 8 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → ∃𝑦 𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
32		eqid 2761	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝐴 ↦ {𝑧}) = (𝑧 ∈ 𝐴 ↦ {𝑧})
33		eqid 2761	. . . . . . . . . . . . . . 15 ⊢ {𝑢 ∣ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧}} = {𝑢 ∣ ∃𝑧 ∈ 𝐴 𝑢 = {𝑧}}
34	32, 33	mptsnun 38242	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ 𝐴 → 𝑥 = ∪ ((𝑧 ∈ 𝐴 ↦ {𝑧}) “ 𝑥))
35	11	unieqd 4880	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ 𝐴 → ∪ ((𝑧 ∈ 𝐴 ↦ {𝑧}) “ 𝑥) = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
36	34, 35	eqtrd 2796	. . . . . . . . . . . . 13 ⊢ (𝑥 ⊆ 𝐴 → 𝑥 = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
37	36	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → 𝑥 = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
38	27, 37	jca 521	. . . . . . . . . . 11 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → ({𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵 ∧ 𝑥 = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}}))
39		sseq1 3956	. . . . . . . . . . . 12 ⊢ (𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → (𝑦 ⊆ 𝐵 ↔ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵))
40		unieq 4878	. . . . . . . . . . . . 13 ⊢ (𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → ∪ 𝑦 = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})
41	40	eqeq2d 2772	. . . . . . . . . . . 12 ⊢ (𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → (𝑥 = ∪ 𝑦 ↔ 𝑥 = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}}))
42	39, 41	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → ((𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦) ↔ ({𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} ⊆ 𝐵 ∧ 𝑥 = ∪ {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}})))
43	38, 42	syl5ibrcom 250	. . . . . . . . . 10 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → (𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → (𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
44	43	eximdv 1950	. . . . . . . . 9 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴) → (∃𝑦 𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
45	44	3adant3 1150	. . . . . . . 8 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → (∃𝑦 𝑦 = {𝑢 ∣ ∃𝑧 ∈ 𝑥 𝑢 = {𝑧}} → ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
46	31, 45	mpd 16	. . . . . . 7 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ⊆ 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))
47	4, 46	syl3an2b 1431	. . . . . 6 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝑥 ∈ 𝒫 𝐴 ∧ 𝐵 ∈ (TopOn‘𝐴)) → ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))
48	47	3com23 1144	. . . . 5 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴) ∧ 𝑥 ∈ 𝒫 𝐴) → ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))
49	48	3expia 1139	. . . 4 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → (𝑥 ∈ 𝒫 𝐴 → ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
50		topontop 23224	. . . . . . . 8 ⊢ (𝐵 ∈ (TopOn‘𝐴) → 𝐵 ∈ Top)
51		tgtop 23284	. . . . . . . 8 ⊢ (𝐵 ∈ Top → (topGen‘𝐵) = 𝐵)
52	50, 51	syl 18	. . . . . . 7 ⊢ (𝐵 ∈ (TopOn‘𝐴) → (topGen‘𝐵) = 𝐵)
53	52	eleq2d 2847	. . . . . 6 ⊢ (𝐵 ∈ (TopOn‘𝐴) → (𝑥 ∈ (topGen‘𝐵) ↔ 𝑥 ∈ 𝐵))
54		eltg3 23273	. . . . . 6 ⊢ (𝐵 ∈ (TopOn‘𝐴) → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
55	53, 54	bitr3d 284	. . . . 5 ⊢ (𝐵 ∈ (TopOn‘𝐴) → (𝑥 ∈ 𝐵 ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
56	55	adantl 487	. . . 4 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → (𝑥 ∈ 𝐵 ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
57	49, 56	sylibrd 262	. . 3 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → (𝑥 ∈ 𝒫 𝐴 → 𝑥 ∈ 𝐵))
58	57	ssrdv 3937	. 2 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → 𝒫 𝐴 ⊆ 𝐵)
59	3, 58	eqssd 3948	1 ⊢ ((𝐶 ⊆ 𝐵 ∧ 𝐵 ∈ (TopOn‘𝐴)) → 𝐵 = 𝒫 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2739  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {csn 4584  {cpr 4586  ∪ cuni 4867   ↦ cmpt 5186  ran crn 5652   ↾ cres 5653   “ cima 5654  ‘cfv 6537  topGenctg 17601  Topctop 23204  TopOnctopon 23221

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fv 6545  df-topgen 17607  df-top 23205  df-topon 23222

This theorem is used by:  dissneq  38244