Theorem bj-om 13124

Description: A set is equal to om if and only if it is the smallest inductive set. (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-om	|- ( A e. V -> ( A = om <-> (Ind A /\ A. x (Ind x -> A C_ x ) ) ) )

Distinct variable group:   x, A

Allowed substitution hint:   V( x)

Proof of Theorem bj-om

Step	Hyp	Ref	Expression
1		bj-omind 13121	. . . 4 |- Ind om
2		bj-indeq 13116	. . . 4 |- ( A = om -> (Ind A <-> Ind om ) )
3	1, 2	mpbiri 167	. . 3 |- ( A = om -> Ind A )
4		vex 2684	. . . . . 6 |- x e. _V
5		bj-omssind 13122	. . . . . 6 |- ( x e. _V -> (Ind x -> om C_ x ) )
6	4, 5	ax-mp 5	. . . . 5 |- (Ind x -> om C_ x )
7		sseq1 3115	. . . . 5 |- ( A = om -> ( A C_ x <-> om C_ x ) )
8	6, 7	syl5ibr 155	. . . 4 |- ( A = om -> (Ind x -> A C_ x ) )
9	8	alrimiv 1846	. . 3 |- ( A = om -> A. x (Ind x -> A C_ x ) )
10	3, 9	jca 304	. 2 |- ( A = om -> (Ind A /\ A. x (Ind x -> A C_ x ) ) )
11		bj-ssom 13123	. . . . . . 7 |- ( A. x (Ind x -> A C_ x ) <-> A C_ om )
12	11	biimpi 119	. . . . . 6 |- ( A. x (Ind x -> A C_ x ) -> A C_ om )
13	12	adantl 275	. . . . 5 |- ( (Ind A /\ A. x (Ind x -> A C_ x ) ) -> A C_ om )
14	13	a1i 9	. . . 4 |- ( A e. V -> ( (Ind A /\ A. x (Ind x -> A C_ x ) ) -> A C_ om ) )
15		bj-omssind 13122	. . . . 5 |- ( A e. V -> (Ind A -> om C_ A ) )
16	15	adantrd 277	. . . 4 |- ( A e. V -> ( (Ind A /\ A. x (Ind x -> A C_ x ) ) -> om C_ A ) )
17	14, 16	jcad 305	. . 3 |- ( A e. V -> ( (Ind A /\ A. x (Ind x -> A C_ x ) ) -> ( A C_ om /\ om C_ A ) ) )
18		eqss 3107	. . 3 |- ( A = om <-> ( A C_ om /\ om C_ A ) )
19	17, 18	syl6ibr 161	. 2 |- ( A e. V -> ( (Ind A /\ A. x (Ind x -> A C_ x ) ) -> A = om ) )
20	10, 19	impbid2 142	1 |- ( A e. V -> ( A = om <-> (Ind A /\ A. x (Ind x -> A C_ x ) ) ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   A.wal 1329   = wceq 1331   e. wcel 1480   _Vcvv 2681   C_ wss 3066   omcom 4499  Ind wind 13113

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-nul 4049  ax-pr 4126  ax-un 4350  ax-bd0 13000  ax-bdor 13003  ax-bdex 13006  ax-bdeq 13007  ax-bdel 13008  ax-bdsb 13009  ax-bdsep 13071

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-rab 2423  df-v 2683  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-sn 3528  df-pr 3529  df-uni 3732  df-int 3767  df-suc 4288  df-iom 4500  df-bdc 13028  df-bj-ind 13114

This theorem is referenced by:  bj-2inf  13125  bj-inf2vn  13161  bj-inf2vn2  13162