MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elina Structured version   Visualization version   GIF version

Theorem elina 10582
Description: Conditions of strong inaccessibility. (Contributed by Mario Carneiro, 22-Jun-2013.)
Assertion
Ref Expression
elina (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴 𝒫 𝑥𝐴))
Distinct variable group:   𝑥,𝐴

Proof of Theorem elina
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elex 3462 . 2 (𝐴 ∈ Inacc → 𝐴 ∈ V)
2 fvex 6853 . . . 4 (cf‘𝐴) ∈ V
3 eleq1 2826 . . . 4 ((cf‘𝐴) = 𝐴 → ((cf‘𝐴) ∈ V ↔ 𝐴 ∈ V))
42, 3mpbii 232 . . 3 ((cf‘𝐴) = 𝐴𝐴 ∈ V)
543ad2ant2 1135 . 2 ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴 𝒫 𝑥𝐴) → 𝐴 ∈ V)
6 neeq1 3005 . . . 4 (𝑦 = 𝐴 → (𝑦 ≠ ∅ ↔ 𝐴 ≠ ∅))
7 fveq2 6840 . . . . 5 (𝑦 = 𝐴 → (cf‘𝑦) = (cf‘𝐴))
8 eqeq12 2755 . . . . 5 (((cf‘𝑦) = (cf‘𝐴) ∧ 𝑦 = 𝐴) → ((cf‘𝑦) = 𝑦 ↔ (cf‘𝐴) = 𝐴))
97, 8mpancom 687 . . . 4 (𝑦 = 𝐴 → ((cf‘𝑦) = 𝑦 ↔ (cf‘𝐴) = 𝐴))
10 breq2 5108 . . . . 5 (𝑦 = 𝐴 → (𝒫 𝑥𝑦 ↔ 𝒫 𝑥𝐴))
1110raleqbi1dv 3306 . . . 4 (𝑦 = 𝐴 → (∀𝑥𝑦 𝒫 𝑥𝑦 ↔ ∀𝑥𝐴 𝒫 𝑥𝐴))
126, 9, 113anbi123d 1437 . . 3 (𝑦 = 𝐴 → ((𝑦 ≠ ∅ ∧ (cf‘𝑦) = 𝑦 ∧ ∀𝑥𝑦 𝒫 𝑥𝑦) ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴 𝒫 𝑥𝐴)))
13 df-ina 10580 . . 3 Inacc = {𝑦 ∣ (𝑦 ≠ ∅ ∧ (cf‘𝑦) = 𝑦 ∧ ∀𝑥𝑦 𝒫 𝑥𝑦)}
1412, 13elab2g 3631 . 2 (𝐴 ∈ V → (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴 𝒫 𝑥𝐴)))
151, 5, 14pm5.21nii 380 1 (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴 𝒫 𝑥𝐴))
Colors of variables: wff setvar class
Syntax hints:  wb 205  w3a 1088   = wceq 1542  wcel 2107  wne 2942  wral 3063  Vcvv 3444  c0 4281  𝒫 cpw 4559   class class class wbr 5104  cfv 6494  csdm 8841  cfccf 9832  Inacccina 10578
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2709  ax-nul 5262
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2943  df-ral 3064  df-rab 3407  df-v 3446  df-dif 3912  df-un 3914  df-in 3916  df-ss 3926  df-nul 4282  df-if 4486  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4865  df-br 5105  df-iota 6446  df-fv 6502  df-ina 10580
This theorem is referenced by:  inawina  10585  omina  10586  gchina  10594  inar1  10670  inatsk  10673  tskcard  10676  tskuni  10678  gruina  10713  grur1  10715
  Copyright terms: Public domain W3C validator