Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-bdfindes GIF version

Theorem bj-bdfindes 16736
Description: Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 16734 for explanations. From this version, it is easy to prove the bounded version of findes 4727. (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.
StepHypRef Expression
1 nfv 1577 . . . 4 𝑦𝜑
2 nfv 1577 . . . 4 𝑦[suc 𝑥 / 𝑥]𝜑
31, 2nfim 1621 . . 3 𝑦(𝜑[suc 𝑥 / 𝑥]𝜑)
4 nfs1v 1995 . . . 4 𝑥[𝑦 / 𝑥]𝜑
5 nfsbc1v 3063 . . . 4 𝑥[suc 𝑦 / 𝑥]𝜑
64, 5nfim 1621 . . 3 𝑥([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑)
7 sbequ12 1820 . . . 4 (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
8 suceq 4525 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
98sbceq1d 3049 . . . 4 (𝑥 = 𝑦 → ([suc 𝑥 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑))
107, 9imbi12d 234 . . 3 (𝑥 = 𝑦 → ((𝜑[suc 𝑥 / 𝑥]𝜑) ↔ ([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑)))
113, 6, 10cbvral 2776 . 2 (∀𝑥 ∈ ω (𝜑[suc 𝑥 / 𝑥]𝜑) ↔ ∀𝑦 ∈ ω ([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑))
12 bj-bdfindes.bd . . 3 BOUNDED 𝜑
13 nfsbc1v 3063 . . 3 𝑥[∅ / 𝑥]𝜑
14 sbceq1a 3054 . . . 4 (𝑥 = ∅ → (𝜑[∅ / 𝑥]𝜑))
1514biimprd 158 . . 3 (𝑥 = ∅ → ([∅ / 𝑥]𝜑𝜑))
16 sbequ1 1817 . . 3 (𝑥 = 𝑦 → (𝜑 → [𝑦 / 𝑥]𝜑))
17 sbceq1a 3054 . . . 4 (𝑥 = suc 𝑦 → (𝜑[suc 𝑦 / 𝑥]𝜑))
1817biimprd 158 . . 3 (𝑥 = suc 𝑦 → ([suc 𝑦 / 𝑥]𝜑𝜑))
1912, 13, 4, 5, 15, 16, 18bj-bdfindis 16734 . 2 (([∅ / 𝑥]𝜑 ∧ ∀𝑦 ∈ ω ([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)
2011, 19sylan2b 287 1 (([∅ / 𝑥]𝜑 ∧ ∀𝑥 ∈ ω (𝜑[suc 𝑥 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  [wsb 1811  wral 2522  [wsbc 3044  c0 3510  suc csuc 4488  ωcom 4714  BOUNDED wbd 16599
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 4238  ax-pr 4324  ax-un 4556  ax-bd0 16600  ax-bdor 16603  ax-bdex 16606  ax-bdeq 16607  ax-bdel 16608  ax-bdsb 16609  ax-bdsep 16671  ax-infvn 16728
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-sbc 3045  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-sn 3697  df-pr 3698  df-uni 3917  df-int 3952  df-suc 4494  df-iom 4715  df-bdc 16628  df-bj-ind 16714
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator