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

Theorem bj-bdfindes 15922
Description: Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 15920 for explanations. From this version, it is easy to prove the bounded version of findes 4652. (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 1551 . . . 4 𝑦𝜑
2 nfv 1551 . . . 4 𝑦[suc 𝑥 / 𝑥]𝜑
31, 2nfim 1595 . . 3 𝑦(𝜑[suc 𝑥 / 𝑥]𝜑)
4 nfs1v 1967 . . . 4 𝑥[𝑦 / 𝑥]𝜑
5 nfsbc1v 3017 . . . 4 𝑥[suc 𝑦 / 𝑥]𝜑
64, 5nfim 1595 . . 3 𝑥([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑)
7 sbequ12 1794 . . . 4 (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
8 suceq 4450 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
98sbceq1d 3003 . . . 4 (𝑥 = 𝑦 → ([suc 𝑥 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑))
107, 9imbi12d 234 . . 3 (𝑥 = 𝑦 → ((𝜑[suc 𝑥 / 𝑥]𝜑) ↔ ([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑)))
113, 6, 10cbvral 2734 . 2 (∀𝑥 ∈ ω (𝜑[suc 𝑥 / 𝑥]𝜑) ↔ ∀𝑦 ∈ ω ([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑))
12 bj-bdfindes.bd . . 3 BOUNDED 𝜑
13 nfsbc1v 3017 . . 3 𝑥[∅ / 𝑥]𝜑
14 sbceq1a 3008 . . . 4 (𝑥 = ∅ → (𝜑[∅ / 𝑥]𝜑))
1514biimprd 158 . . 3 (𝑥 = ∅ → ([∅ / 𝑥]𝜑𝜑))
16 sbequ1 1791 . . 3 (𝑥 = 𝑦 → (𝜑 → [𝑦 / 𝑥]𝜑))
17 sbceq1a 3008 . . . 4 (𝑥 = suc 𝑦 → (𝜑[suc 𝑦 / 𝑥]𝜑))
1817biimprd 158 . . 3 (𝑥 = suc 𝑦 → ([suc 𝑦 / 𝑥]𝜑𝜑))
1912, 13, 4, 5, 15, 16, 18bj-bdfindis 15920 . 2 (([∅ / 𝑥]𝜑 ∧ ∀𝑦 ∈ ω ([𝑦 / 𝑥]𝜑[suc 𝑦 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)
2011, 19sylan2b 287 1 (([∅ / 𝑥]𝜑 ∧ ∀𝑥 ∈ ω (𝜑[suc 𝑥 / 𝑥]𝜑)) → ∀𝑥 ∈ ω 𝜑)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  [wsb 1785  wral 2484  [wsbc 2998  c0 3460  suc csuc 4413  ωcom 4639  BOUNDED wbd 15785
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-nul 4171  ax-pr 4254  ax-un 4481  ax-bd0 15786  ax-bdor 15789  ax-bdex 15792  ax-bdeq 15793  ax-bdel 15794  ax-bdsb 15795  ax-bdsep 15857  ax-infvn 15914
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-sn 3639  df-pr 3640  df-uni 3851  df-int 3886  df-suc 4419  df-iom 4640  df-bdc 15814  df-bj-ind 15900
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator