Theorem elina 10676

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.

Step	Hyp	Ref	Expression
1		elex 3476	. 2 ⊢ (𝐴 ∈ Inacc → 𝐴 ∈ V)
2		fvex 6894	. . . 4 ⊢ (cf‘𝐴) ∈ V
3		eleq1 2851	. . . 4 ⊢ ((cf‘𝐴) = 𝐴 → ((cf‘𝐴) ∈ V ↔ 𝐴 ∈ V))
4	2, 3	mpbii 236	. . 3 ⊢ ((cf‘𝐴) = 𝐴 → 𝐴 ∈ V)
5	4	3ad2ant2 1152	. 2 ⊢ ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴) → 𝐴 ∈ V)
6		neeq1 3020	. . . 4 ⊢ (𝑦 = 𝐴 → (𝑦 ≠ ∅ ↔ 𝐴 ≠ ∅))
7		fveq2 6881	. . . . 5 ⊢ (𝑦 = 𝐴 → (cf‘𝑦) = (cf‘𝐴))
8		eqeq12 2780	. . . . 5 ⊢ (((cf‘𝑦) = (cf‘𝐴) ∧ 𝑦 = 𝐴) → ((cf‘𝑦) = 𝑦 ↔ (cf‘𝐴) = 𝐴))
9	7, 8	mpancom 700	. . . 4 ⊢ (𝑦 = 𝐴 → ((cf‘𝑦) = 𝑦 ↔ (cf‘𝐴) = 𝐴))
10		breq2 5113	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝒫 𝑥 ≺ 𝑦 ↔ 𝒫 𝑥 ≺ 𝐴))
11	10	raleqbi1dv 3333	. . . 4 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑦 𝒫 𝑥 ≺ 𝑦 ↔ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴))
12	6, 9, 11	3anbi123d 1464	. . 3 ⊢ (𝑦 = 𝐴 → ((𝑦 ≠ ∅ ∧ (cf‘𝑦) = 𝑦 ∧ ∀𝑥 ∈ 𝑦 𝒫 𝑥 ≺ 𝑦) ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴)))
13		df-ina 10674	. . 3 ⊢ Inacc = {𝑦 ∣ (𝑦 ≠ ∅ ∧ (cf‘𝑦) = 𝑦 ∧ ∀𝑥 ∈ 𝑦 𝒫 𝑥 ≺ 𝑦)}
14	12, 13	elab2g 3639	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴)))
15	1, 5, 14	pm5.21nii 381	1 ⊢ (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴))

This proof depends on syntax axioms:   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  Vcvv 3455  ∅c0 4286  𝒫 cpw 4562   class class class wbr 5109  ‘cfv 6536   ≺ csdm 8938  cfccf 9928  Inacccina 10672

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5269

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544  df-ina 10674

This theorem is used by:  inawina  10679  omina  10680  gchina  10688  inar1  10764  inatsk  10767  tskcard  10770  tskuni  10772  gruina  10807  grur1  10809