Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  kur14lem9 Structured version   Visualization version   GIF version

Theorem kur14lem9 36187
Description: Lemma for kur14 36189. Since the set 𝑇 is closed under closure and complement, it contains the minimal set 𝑆 as a subset, so 𝑆 also has at most 14 elements. (Indeed 𝑆 = 𝑇, and it's not hard to prove this, but we don't need it for this proof.) (Contributed by Mario Carneiro, 11-Feb-2015.)
Hypotheses
Ref Expression
kur14lem.j 𝐽 ∈ Top
kur14lem.x 𝑋 = ∪ 𝐽
kur14lem.k 𝐾 = (cls‘𝐽)
kur14lem.i 𝐼 = (int‘𝐽)
kur14lem.a 𝐴 ⊆ 𝑋
kur14lem.b 𝐵 = (𝑋 ∖ (𝐾‘𝐴))
kur14lem.c 𝐶 = (𝐾‘(𝑋 ∖ 𝐴))
kur14lem.d 𝐷 = (𝐼‘(𝐾‘𝐴))
kur14lem.t 𝑇 = ((({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ∪ {(𝐾‘𝐵), 𝐷, (𝐾‘(𝐼‘𝐴))}) ∪ ({(𝐼‘𝐶), (𝐾‘𝐷), (𝐼‘(𝐾‘𝐵))} ∪ {(𝐾‘(𝐼‘𝐶)), (𝐼‘(𝐾‘(𝐼‘𝐴)))}))
kur14lem.s 𝑆 = ∩ {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥)}
Assertion
Ref Expression
kur14lem9 (𝑆 ∈ Fin ∧ (♯‘𝑆) ≤ 14)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐾   𝑥,𝑦,𝑇   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥, 𝑦)   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝐼(𝑥, 𝑦)   𝐽(𝑥, 𝑦)   𝐾(𝑦)

Proof of Theorem kur14lem9
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 kur14lem.s . . 3 𝑆 = ∩ {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥)}
2 vex 3458 . . . . . 6 𝑠 ∈ V
32elintrab 4925 . . . . 5 (𝑠 ∈ ∩ {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥)} ↔ ∀𝑥 ∈ 𝒫 𝒫 𝑋((𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥) → 𝑠 ∈ 𝑥))
4 ssun1 4179 . . . . . . . 8 {𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ⊆ ({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)})
5 ssun1 4179 . . . . . . . . 9 ({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ⊆ (({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ∪ {(𝐾‘𝐵), 𝐷, (𝐾‘(𝐼‘𝐴))})
6 ssun1 4179 . . . . . . . . . 10 (({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ∪ {(𝐾‘𝐵), 𝐷, (𝐾‘(𝐼‘𝐴))}) ⊆ ((({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ∪ {(𝐾‘𝐵), 𝐷, (𝐾‘(𝐼‘𝐴))}) ∪ ({(𝐼‘𝐶), (𝐾‘𝐷), (𝐼‘(𝐾‘𝐵))} ∪ {(𝐾‘(𝐼‘𝐶)), (𝐼‘(𝐾‘(𝐼‘𝐴)))}))
7 kur14lem.t . . . . . . . . . 10 𝑇 = ((({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ∪ {(𝐾‘𝐵), 𝐷, (𝐾‘(𝐼‘𝐴))}) ∪ ({(𝐼‘𝐶), (𝐾‘𝐷), (𝐼‘(𝐾‘𝐵))} ∪ {(𝐾‘(𝐼‘𝐶)), (𝐼‘(𝐾‘(𝐼‘𝐴)))}))
86, 7sseqtrri 3962 . . . . . . . . 9 (({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ∪ {(𝐾‘𝐵), 𝐷, (𝐾‘(𝐼‘𝐴))}) ⊆ 𝑇
95, 8sstri 3922 . . . . . . . 8 ({𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ∪ {𝐵, 𝐶, (𝐼‘𝐴)}) ⊆ 𝑇
104, 9sstri 3922 . . . . . . 7 {𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)} ⊆ 𝑇
11 kur14lem.j . . . . . . . . . . 11 𝐽 ∈ Top
12 kur14lem.x . . . . . . . . . . . 12 𝑋 = ∪ 𝐽
1312topopn 23279 . . . . . . . . . . 11 (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
1411, 13ax-mp 5 . . . . . . . . . 10 𝑋 ∈ 𝐽
1514elexi 3476 . . . . . . . . 9 𝑋 ∈ V
16 kur14lem.a . . . . . . . . 9 𝐴 ⊆ 𝑋
1715, 16ssexi 5291 . . . . . . . 8 𝐴 ∈ V
1817tpid1 4731 . . . . . . 7 𝐴 ∈ {𝐴, (𝑋 ∖ 𝐴), (𝐾‘𝐴)}
1910, 18sselii 3910 . . . . . 6 𝐴 ∈ 𝑇
20 kur14lem.k . . . . . . . . 9 𝐾 = (cls‘𝐽)
21 kur14lem.i . . . . . . . . 9 𝐼 = (int‘𝐽)
22 kur14lem.b . . . . . . . . 9 𝐵 = (𝑋 ∖ (𝐾‘𝐴))
23 kur14lem.c . . . . . . . . 9 𝐶 = (𝐾‘(𝑋 ∖ 𝐴))
24 kur14lem.d . . . . . . . . 9 𝐷 = (𝐼‘(𝐾‘𝐴))
2511, 12, 20, 21, 16, 22, 23, 24, 7kur14lem7 36185 . . . . . . . 8 (𝑦 ∈ 𝑇 → (𝑦 ⊆ 𝑋 ∧ {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇))
2625simprd 501 . . . . . . 7 (𝑦 ∈ 𝑇 → {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇)
2726rgen 3082 . . . . . 6 ∀𝑦 ∈ 𝑇 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇
2825simpld 500 . . . . . . . . . 10 (𝑦 ∈ 𝑇 → 𝑦 ⊆ 𝑋)
2915elpw2 5303 . . . . . . . . . 10 (𝑦 ∈ 𝒫 𝑋 ↔ 𝑦 ⊆ 𝑋)
3028, 29sylibr 237 . . . . . . . . 9 (𝑦 ∈ 𝑇 → 𝑦 ∈ 𝒫 𝑋)
3130ssriv 3917 . . . . . . . 8 𝑇 ⊆ 𝒫 𝑋
3215pwex 5349 . . . . . . . . 9 𝒫 𝑋 ∈ V
3332elpw2 5303 . . . . . . . 8 (𝑇 ∈ 𝒫 𝒫 𝑋 ↔ 𝑇 ⊆ 𝒫 𝑋)
3431, 33mpbir 234 . . . . . . 7 𝑇 ∈ 𝒫 𝒫 𝑋
35 eleq2 2853 . . . . . . . . . 10 (𝑥 = 𝑇 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝑇))
36 sseq2 3939 . . . . . . . . . . 11 (𝑥 = 𝑇 → ({(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥 ↔ {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇))
3736raleqbi1dv 3333 . . . . . . . . . 10 (𝑥 = 𝑇 → (∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝑇 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇))
3835, 37anbi12d 644 . . . . . . . . 9 (𝑥 = 𝑇 → ((𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥) ↔ (𝐴 ∈ 𝑇 ∧ ∀𝑦 ∈ 𝑇 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇)))
39 eleq2 2853 . . . . . . . . 9 (𝑥 = 𝑇 → (𝑠 ∈ 𝑥 ↔ 𝑠 ∈ 𝑇))
4038, 39imbi12d 347 . . . . . . . 8 (𝑥 = 𝑇 → (((𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥) → 𝑠 ∈ 𝑥) ↔ ((𝐴 ∈ 𝑇 ∧ ∀𝑦 ∈ 𝑇 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇) → 𝑠 ∈ 𝑇)))
4140rspccv 3577 . . . . . . 7 (∀𝑥 ∈ 𝒫 𝒫 𝑋((𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥) → 𝑠 ∈ 𝑥) → (𝑇 ∈ 𝒫 𝒫 𝑋 → ((𝐴 ∈ 𝑇 ∧ ∀𝑦 ∈ 𝑇 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇) → 𝑠 ∈ 𝑇)))
4234, 41mpi 21 . . . . . 6 (∀𝑥 ∈ 𝒫 𝒫 𝑋((𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥) → 𝑠 ∈ 𝑥) → ((𝐴 ∈ 𝑇 ∧ ∀𝑦 ∈ 𝑇 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑇) → 𝑠 ∈ 𝑇))
4319, 27, 42mp2ani 711 . . . . 5 (∀𝑥 ∈ 𝒫 𝒫 𝑋((𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥) → 𝑠 ∈ 𝑥) → 𝑠 ∈ 𝑇)
443, 43sylbi 220 . . . 4 (𝑠 ∈ ∩ {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥)} → 𝑠 ∈ 𝑇)
4544ssriv 3917 . . 3 ∩ {𝑥 ∈ 𝒫 𝒫 𝑋 ∣ (𝐴 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 {(𝑋 ∖ 𝑦), (𝐾‘𝑦)} ⊆ 𝑥)} ⊆ 𝑇
461, 45eqsstri 3959 . 2 𝑆 ⊆ 𝑇
4711, 12, 20, 21, 16, 22, 23, 24, 7kur14lem8 36186 . 2 (𝑇 ∈ Fin ∧ (♯‘𝑇) ≤ 14)
48 1nn0 12662 . . 3 1 ∈ ℕ0
49 4nn0 12665 . . 3 4 ∈ ℕ0
5048, 49deccl 12869 . 2 14 ∈ ℕ0
5146, 47, 50hashsslei 14612 1 (𝑆 ∈ Fin ∧ (♯‘𝑆) ≤ 14)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900   ∖ cdif 4048   ∪ cun 4152  𝒫 cpw 4560  {cpr 4590  {ctp 4592  ∪ cuni 4872  ∩ cint 4912   class class class wbr 5108  ‘cfv 6566  Fincfn 9011  1c1 11240   ≤ cle 11383  4c4 12439  cdc 12854  ♯chash 14515  Topctop 23266  intcnt 23390  clsccl 23391
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-xnn0 12720  df-z 12734  df-dec 12855  df-uz 13006  df-fz 13680  df-hash 14516  df-top 23267  df-cld 23392  df-ntr 23393  df-cls 23394
This theorem is used by:  kur14lem10  36188
  Copyright terms: Public domain W3C validator