Theorem bdfind 17189

Description: Bounded induction (principle of induction when 𝐴 is assumed to be bounded), proved from basic constructive axioms. See find 4748 for a nonconstructive proof of the general case. See findset 17188 for a proof when 𝐴 is assumed to be a set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)

Hypothesis

Ref	Expression
bdfind.bd	⊢ BOUNDED 𝐴

Assertion

Ref	Expression
bdfind	⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → 𝐴 = ω)

Distinct variable group:   𝑥,𝐴

Proof of Theorem bdfind

Step	Hyp	Ref	Expression
1		bdfind.bd	. . . 4 ⊢ BOUNDED 𝐴
2		bj-omex 17185	. . . 4 ⊢ ω ∈ V
3	1, 2	bdssex 17145	. . 3 ⊢ (𝐴 ⊆ ω → 𝐴 ∈ V)
4	3	3ad2ant1 1049	. 2 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → 𝐴 ∈ V)
5		findset 17188	. 2 ⊢ (𝐴 ∈ V → ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → 𝐴 = ω))
6	4, 5	mpcom 36	1 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → 𝐴 = ω)

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  ∅c0 3520  suc csuc 4512  ωcom 4739  BOUNDED wbdc 17083

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-nul 4261  ax-pr 4348  ax-un 4580  ax-bd0 17056  ax-bdan 17058  ax-bdor 17059  ax-bdex 17062  ax-bdeq 17063  ax-bdel 17064  ax-bdsb 17065  ax-bdsep 17127  ax-infvn 17184

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-sn 3715  df-pr 3716  df-uni 3936  df-int 3971  df-suc 4518  df-iom 4740  df-bdc 17084  df-bj-ind 17170

This theorem is used by: (None)