Theorem bj-bdfindes 16665

Description: Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 16663 for explanations. From this version, it is easy to prove the bounded version of findes 4707. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)

Hypothesis

Ref	Expression
bj-bdfindes.bd	⊢ BOUNDED 𝜑

Assertion

Ref	Expression
bj-bdfindes	⊢ (([∅ / 𝑥]𝜑 ∧ ∀𝑥 ∈ ω (𝜑 → [suc 𝑥 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)

Proof of Theorem bj-bdfindes

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1577	. . . 4 ⊢ Ⅎ𝑦𝜑
2		nfv 1577	. . . 4 ⊢ Ⅎ𝑦[suc 𝑥 / 𝑥]𝜑
3	1, 2	nfim 1621	. . 3 ⊢ Ⅎ𝑦(𝜑 → [suc 𝑥 / 𝑥]𝜑)
4		nfs1v 1992	. . . 4 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑
5		nfsbc1v 3051	. . . 4 ⊢ Ⅎ𝑥[suc 𝑦 / 𝑥]𝜑
6	4, 5	nfim 1621	. . 3 ⊢ Ⅎ𝑥([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)
7		sbequ12 1819	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
8		suceq 4505	. . . . 5 ⊢ (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
9	8	sbceq1d 3037	. . . 4 ⊢ (𝑥 = 𝑦 → ([suc 𝑥 / 𝑥]𝜑 ↔ [suc 𝑦 / 𝑥]𝜑))
10	7, 9	imbi12d 234	. . 3 ⊢ (𝑥 = 𝑦 → ((𝜑 → [suc 𝑥 / 𝑥]𝜑) ↔ ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)))
11	3, 6, 10	cbvral 2764	. 2 ⊢ (∀𝑥 ∈ ω (𝜑 → [suc 𝑥 / 𝑥]𝜑) ↔ ∀𝑦 ∈ ω ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑))
12		bj-bdfindes.bd	. . 3 ⊢ BOUNDED 𝜑
13		nfsbc1v 3051	. . 3 ⊢ Ⅎ𝑥[∅ / 𝑥]𝜑
14		sbceq1a 3042	. . . 4 ⊢ (𝑥 = ∅ → (𝜑 ↔ [∅ / 𝑥]𝜑))
15	14	biimprd 158	. . 3 ⊢ (𝑥 = ∅ → ([∅ / 𝑥]𝜑 → 𝜑))
16		sbequ1 1816	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → [𝑦 / 𝑥]𝜑))
17		sbceq1a 3042	. . . 4 ⊢ (𝑥 = suc 𝑦 → (𝜑 ↔ [suc 𝑦 / 𝑥]𝜑))
18	17	biimprd 158	. . 3 ⊢ (𝑥 = suc 𝑦 → ([suc 𝑦 / 𝑥]𝜑 → 𝜑))
19	12, 13, 4, 5, 15, 16, 18	bj-bdfindis 16663	. 2 ⊢ (([∅ / 𝑥]𝜑 ∧ ∀𝑦 ∈ ω ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)
20	11, 19	sylan2b 287	1 ⊢ (([∅ / 𝑥]𝜑 ∧ ∀𝑥 ∈ ω (𝜑 → [suc 𝑥 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398  [wsb 1810  ∀wral 2511  [wsbc 3032  ∅c0 3496  suc csuc 4468  ωcom 4694  BOUNDED wbd 16528

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 2204  ax-14 2205  ax-ext 2213  ax-nul 4220  ax-pr 4305  ax-un 4536  ax-bd0 16529  ax-bdor 16532  ax-bdex 16535  ax-bdeq 16536  ax-bdel 16537  ax-bdsb 16538  ax-bdsep 16600  ax-infvn 16657

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-sn 3679  df-pr 3680  df-uni 3899  df-int 3934  df-suc 4474  df-iom 4695  df-bdc 16557  df-bj-ind 16643

This theorem is referenced by: (None)