Theorem bj-omex2 16886

Description: Using bounded set induction and the strong axiom of infinity, ω is a set, that is, we recover ax-infvn 16850 (see bj-2inf 16847 for the equivalence of the latter with bj-omex 16851). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
bj-omex2	⊢ ω ∈ V

Proof of Theorem bj-omex2

Dummy variables 𝑥 𝑦 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-inf2 16885	. . 3 ⊢ ∃𝑎∀𝑥(𝑥 ∈ 𝑎 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝑎 𝑥 = suc 𝑦))
2		vex 2818	. . . 4 ⊢ 𝑎 ∈ V
3		bdcv 16757	. . . . 5 ⊢ BOUNDED 𝑎
4	3	bj-inf2vn 16883	. . . 4 ⊢ (𝑎 ∈ V → (∀𝑥(𝑥 ∈ 𝑎 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝑎 𝑥 = suc 𝑦)) → 𝑎 = ω))
5	2, 4	ax-mp 5	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝑎 ↔ (𝑥 = ∅ ∨ ∃𝑦 ∈ 𝑎 𝑥 = suc 𝑦)) → 𝑎 = ω)
6	1, 5	eximii 1651	. 2 ⊢ ∃𝑎 𝑎 = ω
7	6	issetri 2825	1 ⊢ ω ∈ V

Syntax hints:   → wi 4   ↔ wb 105   ∨ wo 716  ∀wal 1396   = wceq 1398   ∈ wcel 2205  ∃wrex 2523  Vcvv 2815  ∅c0 3512  suc csuc 4491  ωcom 4717

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-nul 4241  ax-pr 4327  ax-un 4559  ax-bd0 16722  ax-bdim 16723  ax-bdor 16725  ax-bdex 16728  ax-bdeq 16729  ax-bdel 16730  ax-bdsb 16731  ax-bdsep 16793  ax-bdsetind 16877  ax-inf2 16885

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-suc 4497  df-iom 4718  df-bdc 16750  df-bj-ind 16836

This theorem is referenced by: (None)