ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  frind GIF version

Theorem frind 4117
Description: Induction over a well-founded set. (Contributed by Jim Kingdon, 28-Sep-2021.)
Hypotheses
Ref Expression
frind.sb (𝑥 = 𝑦 → (𝜑𝜓))
frind.ind ((𝜒𝑥𝐴) → (∀𝑦𝐴 (𝑦𝑅𝑥𝜓) → 𝜑))
frind.fr (𝜒𝑅 Fr 𝐴)
frind.a (𝜒𝐴𝑉)
Assertion
Ref Expression
frind ((𝜒𝑥𝐴) → 𝜑)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦   𝜒,𝑥   𝜑,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem frind
Dummy variables 𝑠 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frind.ind . . . . . . . 8 ((𝜒𝑥𝐴) → (∀𝑦𝐴 (𝑦𝑅𝑥𝜓) → 𝜑))
21ralrimiva 2409 . . . . . . 7 (𝜒 → ∀𝑥𝐴 (∀𝑦𝐴 (𝑦𝑅𝑥𝜓) → 𝜑))
3 nfv 1437 . . . . . . . 8 𝑧(∀𝑦𝐴 (𝑦𝑅𝑥𝜓) → 𝜑)
4 nfv 1437 . . . . . . . . 9 𝑥𝑦𝐴 (𝑦𝑅𝑧𝜓)
5 nfs1v 1831 . . . . . . . . 9 𝑥[𝑧 / 𝑥]𝜑
64, 5nfim 1480 . . . . . . . 8 𝑥(∀𝑦𝐴 (𝑦𝑅𝑧𝜓) → [𝑧 / 𝑥]𝜑)
7 breq2 3796 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝑦𝑅𝑥𝑦𝑅𝑧))
87imbi1d 224 . . . . . . . . . 10 (𝑥 = 𝑧 → ((𝑦𝑅𝑥𝜓) ↔ (𝑦𝑅𝑧𝜓)))
98ralbidv 2343 . . . . . . . . 9 (𝑥 = 𝑧 → (∀𝑦𝐴 (𝑦𝑅𝑥𝜓) ↔ ∀𝑦𝐴 (𝑦𝑅𝑧𝜓)))
10 sbequ12 1670 . . . . . . . . 9 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
119, 10imbi12d 227 . . . . . . . 8 (𝑥 = 𝑧 → ((∀𝑦𝐴 (𝑦𝑅𝑥𝜓) → 𝜑) ↔ (∀𝑦𝐴 (𝑦𝑅𝑧𝜓) → [𝑧 / 𝑥]𝜑)))
123, 6, 11cbvral 2546 . . . . . . 7 (∀𝑥𝐴 (∀𝑦𝐴 (𝑦𝑅𝑥𝜓) → 𝜑) ↔ ∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝜓) → [𝑧 / 𝑥]𝜑))
132, 12sylib 131 . . . . . 6 (𝜒 → ∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝜓) → [𝑧 / 𝑥]𝜑))
14 frind.sb . . . . . . . . . . . 12 (𝑥 = 𝑦 → (𝜑𝜓))
1514elrab3 2722 . . . . . . . . . . 11 (𝑦𝐴 → (𝑦 ∈ {𝑥𝐴𝜑} ↔ 𝜓))
1615imbi2d 223 . . . . . . . . . 10 (𝑦𝐴 → ((𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) ↔ (𝑦𝑅𝑧𝜓)))
1716ralbiia 2355 . . . . . . . . 9 (∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) ↔ ∀𝑦𝐴 (𝑦𝑅𝑧𝜓))
1817a1i 9 . . . . . . . 8 (𝑧𝐴 → (∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) ↔ ∀𝑦𝐴 (𝑦𝑅𝑧𝜓)))
19 nfcv 2194 . . . . . . . . . 10 𝑥𝑧
20 nfcv 2194 . . . . . . . . . 10 𝑥𝐴
2119, 20, 5, 10elrabf 2719 . . . . . . . . 9 (𝑧 ∈ {𝑥𝐴𝜑} ↔ (𝑧𝐴 ∧ [𝑧 / 𝑥]𝜑))
2221baib 839 . . . . . . . 8 (𝑧𝐴 → (𝑧 ∈ {𝑥𝐴𝜑} ↔ [𝑧 / 𝑥]𝜑))
2318, 22imbi12d 227 . . . . . . 7 (𝑧𝐴 → ((∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) → 𝑧 ∈ {𝑥𝐴𝜑}) ↔ (∀𝑦𝐴 (𝑦𝑅𝑧𝜓) → [𝑧 / 𝑥]𝜑)))
2423ralbiia 2355 . . . . . 6 (∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) → 𝑧 ∈ {𝑥𝐴𝜑}) ↔ ∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝜓) → [𝑧 / 𝑥]𝜑))
2513, 24sylibr 141 . . . . 5 (𝜒 → ∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) → 𝑧 ∈ {𝑥𝐴𝜑}))
26 frind.fr . . . . . . . 8 (𝜒𝑅 Fr 𝐴)
27 df-frind 4097 . . . . . . . 8 (𝑅 Fr 𝐴 ↔ ∀𝑠 FrFor 𝑅𝐴𝑠)
2826, 27sylib 131 . . . . . . 7 (𝜒 → ∀𝑠 FrFor 𝑅𝐴𝑠)
29 frind.a . . . . . . . 8 (𝜒𝐴𝑉)
30 rabexg 3928 . . . . . . . 8 (𝐴𝑉 → {𝑥𝐴𝜑} ∈ V)
31 frforeq3 4112 . . . . . . . . 9 (𝑠 = {𝑥𝐴𝜑} → ( FrFor 𝑅𝐴𝑠 ↔ FrFor 𝑅𝐴{𝑥𝐴𝜑}))
3231spcgv 2657 . . . . . . . 8 ({𝑥𝐴𝜑} ∈ V → (∀𝑠 FrFor 𝑅𝐴𝑠 → FrFor 𝑅𝐴{𝑥𝐴𝜑}))
3329, 30, 323syl 17 . . . . . . 7 (𝜒 → (∀𝑠 FrFor 𝑅𝐴𝑠 → FrFor 𝑅𝐴{𝑥𝐴𝜑}))
3428, 33mpd 13 . . . . . 6 (𝜒 → FrFor 𝑅𝐴{𝑥𝐴𝜑})
35 df-frfor 4096 . . . . . 6 ( FrFor 𝑅𝐴{𝑥𝐴𝜑} ↔ (∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) → 𝑧 ∈ {𝑥𝐴𝜑}) → 𝐴 ⊆ {𝑥𝐴𝜑}))
3634, 35sylib 131 . . . . 5 (𝜒 → (∀𝑧𝐴 (∀𝑦𝐴 (𝑦𝑅𝑧𝑦 ∈ {𝑥𝐴𝜑}) → 𝑧 ∈ {𝑥𝐴𝜑}) → 𝐴 ⊆ {𝑥𝐴𝜑}))
3725, 36mpd 13 . . . 4 (𝜒𝐴 ⊆ {𝑥𝐴𝜑})
38 ssrab 3046 . . . 4 (𝐴 ⊆ {𝑥𝐴𝜑} ↔ (𝐴𝐴 ∧ ∀𝑥𝐴 𝜑))
3937, 38sylib 131 . . 3 (𝜒 → (𝐴𝐴 ∧ ∀𝑥𝐴 𝜑))
4039simprd 111 . 2 (𝜒 → ∀𝑥𝐴 𝜑)
4140r19.21bi 2424 1 ((𝜒𝑥𝐴) → 𝜑)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  wal 1257  wcel 1409  [wsb 1661  wral 2323  {crab 2327  Vcvv 2574  wss 2945   class class class wbr 3792   FrFor wfrfor 4092   Fr wfr 4093
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rab 2332  df-v 2576  df-un 2950  df-in 2952  df-ss 2959  df-sn 3409  df-pr 3410  df-op 3412  df-br 3793  df-frfor 4096  df-frind 4097
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator