Theorem elina 9130

Description: Conditions of strong inaccessibility. (Contributed by Mario Carneiro, 22-Jun-2013.)

Assertion

Ref	Expression
elina	|- ( A e. Inacc <-> ( A =/= (/) /\ ( cf ` A ) = A /\ A. x e. A ~P x ~< A ) )

Distinct variable group:   x, A

Proof of Theorem elina

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3040	. 2 |- ( A e. Inacc -> A e. _V )
2		fvex 5889	. . . 4 |- ( cf ` A ) e. _V
3		eleq1 2537	. . . 4 |- ( ( cf ` A ) = A -> ( ( cf ` A ) e. _V <-> A e. _V ) )
4	2, 3	mpbii 216	. . 3 |- ( ( cf ` A ) = A -> A e. _V )
5	4	3ad2ant2 1052	. 2 |- ( ( A =/= (/) /\ ( cf ` A ) = A /\ A. x e. A ~P x ~< A ) -> A e. _V )
6		neeq1 2705	. . . 4 |- ( y = A -> ( y =/= (/) <-> A =/= (/) ) )
7		fveq2 5879	. . . . 5 |- ( y = A -> ( cf ` y ) = ( cf ` A ) )
8		eqeq12 2484	. . . . 5 |- ( ( ( cf ` y ) = ( cf ` A ) /\ y = A ) -> ( ( cf ` y ) = y <-> ( cf ` A ) = A ) )
9	7, 8	mpancom 682	. . . 4 |- ( y = A -> ( ( cf ` y ) = y <-> ( cf ` A ) = A ) )
10		breq2 4399	. . . . 5 |- ( y = A -> ( ~P x ~< y <-> ~P x ~< A ) )
11	10	raleqbi1dv 2981	. . . 4 |- ( y = A -> ( A. x e. y ~P x ~< y <-> A. x e. A ~P x ~< A ) )
12	6, 9, 11	3anbi123d 1365	. . 3 |- ( y = A -> ( ( y =/= (/) /\ ( cf ` y ) = y /\ A. x e. y ~P x ~< y ) <-> ( A =/= (/) /\ ( cf ` A ) = A /\ A. x e. A ~P x ~< A ) ) )
13		df-ina 9128	. . 3 |- Inacc = { y | ( y =/= (/) /\ ( cf ` y ) = y /\ A. x e. y ~P x ~< y ) }
14	12, 13	elab2g 3175	. 2 |- ( A e. _V -> ( A e. Inacc <-> ( A =/= (/) /\ ( cf ` A ) = A /\ A. x e. A ~P x ~< A ) ) )
15	1, 5, 14	pm5.21nii 360	1 |- ( A e. Inacc <-> ( A =/= (/) /\ ( cf ` A ) = A /\ A. x e. A ~P x ~< A ) )

Syntax hints:   <-> wb 189   /\ w3a 1007   = wceq 1452   e. wcel 1904   =/= wne 2641   A.wral 2756   _Vcvv 3031   (/)c0 3722   ~Pcpw 3942   class class class wbr 4395   ` cfv 5589   ~< csdm 7586   cfccf 8389   Inacccina 9126

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-nul 4527

This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-ral 2761  df-rex 2762  df-rab 2765  df-v 3033  df-sbc 3256  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-nul 3723  df-if 3873  df-sn 3960  df-pr 3962  df-op 3966  df-uni 4191  df-br 4396  df-iota 5553  df-fv 5597  df-ina 9128

This theorem is referenced by:  inawina  9133  omina  9134  gchina  9142  inar1  9218  inatsk  9221  tskcard  9224  tskuni  9226  gruina  9261  grur1  9263