Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isnacs Structured version   Visualization version   GIF version

Theorem isnacs 39643
Description: Expand definition of Noetherian-type closure system. (Contributed by Stefan O'Rear, 4-Apr-2015.)
Hypothesis
Ref Expression
isnacs.f 𝐹 = (mrCls‘𝐶)
Assertion
Ref Expression
isnacs (𝐶 ∈ (NoeACS‘𝑋) ↔ (𝐶 ∈ (ACS‘𝑋) ∧ ∀𝑠𝐶𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔)))
Distinct variable groups:   𝐶,𝑔,𝑠   𝑔,𝐹,𝑠   𝑔,𝑋,𝑠

Proof of Theorem isnacs
Dummy variables 𝑐 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 6678 . 2 (𝐶 ∈ (NoeACS‘𝑋) → 𝑋 ∈ V)
2 elfvex 6678 . . 3 (𝐶 ∈ (ACS‘𝑋) → 𝑋 ∈ V)
32adantr 484 . 2 ((𝐶 ∈ (ACS‘𝑋) ∧ ∀𝑠𝐶𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔)) → 𝑋 ∈ V)
4 fveq2 6645 . . . . . 6 (𝑥 = 𝑋 → (ACS‘𝑥) = (ACS‘𝑋))
5 pweq 4513 . . . . . . . . 9 (𝑥 = 𝑋 → 𝒫 𝑥 = 𝒫 𝑋)
65ineq1d 4138 . . . . . . . 8 (𝑥 = 𝑋 → (𝒫 𝑥 ∩ Fin) = (𝒫 𝑋 ∩ Fin))
76rexeqdv 3365 . . . . . . 7 (𝑥 = 𝑋 → (∃𝑔 ∈ (𝒫 𝑥 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔) ↔ ∃𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)))
87ralbidv 3162 . . . . . 6 (𝑥 = 𝑋 → (∀𝑠𝑐𝑔 ∈ (𝒫 𝑥 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔) ↔ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)))
94, 8rabeqbidv 3433 . . . . 5 (𝑥 = 𝑋 → {𝑐 ∈ (ACS‘𝑥) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑥 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)} = {𝑐 ∈ (ACS‘𝑋) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)})
10 df-nacs 39642 . . . . 5 NoeACS = (𝑥 ∈ V ↦ {𝑐 ∈ (ACS‘𝑥) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑥 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)})
11 fvex 6658 . . . . . 6 (ACS‘𝑋) ∈ V
1211rabex 5199 . . . . 5 {𝑐 ∈ (ACS‘𝑋) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)} ∈ V
139, 10, 12fvmpt 6745 . . . 4 (𝑋 ∈ V → (NoeACS‘𝑋) = {𝑐 ∈ (ACS‘𝑋) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)})
1413eleq2d 2875 . . 3 (𝑋 ∈ V → (𝐶 ∈ (NoeACS‘𝑋) ↔ 𝐶 ∈ {𝑐 ∈ (ACS‘𝑋) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)}))
15 fveq2 6645 . . . . . . . . 9 (𝑐 = 𝐶 → (mrCls‘𝑐) = (mrCls‘𝐶))
16 isnacs.f . . . . . . . . 9 𝐹 = (mrCls‘𝐶)
1715, 16eqtr4di 2851 . . . . . . . 8 (𝑐 = 𝐶 → (mrCls‘𝑐) = 𝐹)
1817fveq1d 6647 . . . . . . 7 (𝑐 = 𝐶 → ((mrCls‘𝑐)‘𝑔) = (𝐹𝑔))
1918eqeq2d 2809 . . . . . 6 (𝑐 = 𝐶 → (𝑠 = ((mrCls‘𝑐)‘𝑔) ↔ 𝑠 = (𝐹𝑔)))
2019rexbidv 3256 . . . . 5 (𝑐 = 𝐶 → (∃𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔) ↔ ∃𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔)))
2120raleqbi1dv 3356 . . . 4 (𝑐 = 𝐶 → (∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔) ↔ ∀𝑠𝐶𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔)))
2221elrab 3628 . . 3 (𝐶 ∈ {𝑐 ∈ (ACS‘𝑋) ∣ ∀𝑠𝑐𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = ((mrCls‘𝑐)‘𝑔)} ↔ (𝐶 ∈ (ACS‘𝑋) ∧ ∀𝑠𝐶𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔)))
2314, 22syl6bb 290 . 2 (𝑋 ∈ V → (𝐶 ∈ (NoeACS‘𝑋) ↔ (𝐶 ∈ (ACS‘𝑋) ∧ ∀𝑠𝐶𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔))))
241, 3, 23pm5.21nii 383 1 (𝐶 ∈ (NoeACS‘𝑋) ↔ (𝐶 ∈ (ACS‘𝑋) ∧ ∀𝑠𝐶𝑔 ∈ (𝒫 𝑋 ∩ Fin)𝑠 = (𝐹𝑔)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399   = wceq 1538  wcel 2111  wral 3106  wrex 3107  {crab 3110  Vcvv 3441  cin 3880  𝒫 cpw 4497  cfv 6324  Fincfn 8492  mrClscmrc 16846  ACScacs 16848  NoeACScnacs 39641
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-iota 6283  df-fun 6326  df-fv 6332  df-nacs 39642
This theorem is referenced by:  nacsfg  39644  isnacs2  39645  isnacs3  39649  islnr3  40057
  Copyright terms: Public domain W3C validator