Theorem findset 17142

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

Assertion

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

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem findset

Step	Hyp	Ref	Expression
1		simpr1 1034	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴)) → 𝐴 ⊆ ω)
2		simp2 1029	. . . . . 6 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → ∅ ∈ 𝐴)
3		df-ral 2533	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))
4		alral 2595	. . . . . . . 8 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴) → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))
5	3, 4	sylbi 121	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴 → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))
6	5	3ad2ant3 1051	. . . . . 6 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))
7	2, 6	jca 306	. . . . 5 ⊢ ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)))
8		3anass 1013	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) ↔ (𝐴 ∈ 𝑉 ∧ (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))))
9	8	biimpri 133	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ (∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴))) → (𝐴 ∈ 𝑉 ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)))
10	7, 9	sylan2 286	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴)) → (𝐴 ∈ 𝑉 ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)))
11		speano5 17141	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ ω (𝑥 ∈ 𝐴 → suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴)
12	10, 11	syl 14	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴)) → ω ⊆ 𝐴)
13	1, 12	eqssd 3265	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴)) → 𝐴 = ω)
14	13	ex 115	1 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ⊆ ω ∧ ∅ ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 suc 𝑥 ∈ 𝐴) → 𝐴 = ω))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009  ∀wal 1400   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  ∅c0 3520  suc csuc 4510  ωcom 4737

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 4259  ax-pr 4346  ax-un 4578  ax-bd0 17010  ax-bdan 17012  ax-bdor 17013  ax-bdex 17016  ax-bdeq 17017  ax-bdel 17018  ax-bdsb 17019  ax-bdsep 17081  ax-infvn 17138

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 4516  df-iom 4738  df-bdc 17038  df-bj-ind 17124

This theorem is used by:  bdfind  17143