Theorem rtrclind 14416

Description: Principle of transitive induction. The first three hypotheses give various existences, the next four give necessary substitutions and the last two are the basis and the induction step. (Contributed by Drahflow, 12-Nov-2015.) (Revised by AV, 13-Jul-2024.)

Hypotheses

Ref	Expression
rtrclind.1	⊢ (𝜂 → Rel 𝑅)
rtrclind.2	⊢ (𝜂 → 𝑆 ∈ 𝑉)
rtrclind.3	⊢ (𝜂 → 𝑋 ∈ 𝑊)
rtrclind.4	⊢ (𝑖 = 𝑆 → (𝜑 ↔ 𝜒))
rtrclind.5	⊢ (𝑖 = 𝑥 → (𝜑 ↔ 𝜓))
rtrclind.6	⊢ (𝑖 = 𝑗 → (𝜑 ↔ 𝜃))
rtrclind.7	⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜏))
rtrclind.8	⊢ (𝜂 → 𝜒)
rtrclind.9	⊢ (𝜂 → (𝑗𝑅𝑥 → (𝜃 → 𝜓)))

Assertion

Ref	Expression
rtrclind	⊢ (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏))

Distinct variable groups:   𝑥,𝑅,𝑖,𝑗   𝑥,𝑆,𝑖,𝑗   𝑥,𝑋   𝜂,𝑥,𝑖,𝑗   𝜏,𝑥   𝜓,𝑖,𝑗   𝜃,𝑖   𝜑,𝑗,𝑥   𝜒,𝑖

Allowed substitution hints:   𝜑(𝑖)   𝜓(𝑥)   𝜒(𝑥,𝑗)   𝜃(𝑥,𝑗)   𝜏(𝑖,𝑗)   𝑉(𝑥,𝑖,𝑗)   𝑊(𝑥,𝑖,𝑗)   𝑋(𝑖,𝑗)

Proof of Theorem rtrclind

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rtrclind.1	. . 3 ⊢ (𝜂 → Rel 𝑅)
2	1	dfrtrcl2 14413	. 2 ⊢ (𝜂 → (t*‘𝑅) = (t*rec‘𝑅))
3	1	dfrtrclrec2 14409	. . . . . 6 ⊢ (𝜂 → (𝑆(t*rec‘𝑅)𝑋 ↔ ∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋))
4	3	biimpac 482	. . . . 5 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → ∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋)
5		simprl 770	. . . . . . . . . 10 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝜂)
6		simprrr 781	. . . . . . . . . 10 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝑛 ∈ ℕ0)
7		simprrl 780	. . . . . . . . . 10 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝑆(𝑅↑𝑟𝑛)𝑋)
8		rtrclind.2	. . . . . . . . . . 11 ⊢ (𝜂 → 𝑆 ∈ 𝑉)
9		rtrclind.3	. . . . . . . . . . 11 ⊢ (𝜂 → 𝑋 ∈ 𝑊)
10		rtrclind.4	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑆 → (𝜑 ↔ 𝜒))
11		rtrclind.5	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑥 → (𝜑 ↔ 𝜓))
12		rtrclind.6	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑗 → (𝜑 ↔ 𝜃))
13		rtrclind.7	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜏))
14		rtrclind.8	. . . . . . . . . . 11 ⊢ (𝜂 → 𝜒)
15		rtrclind.9	. . . . . . . . . . 11 ⊢ (𝜂 → (𝑗𝑅𝑥 → (𝜃 → 𝜓)))
16	1, 8, 9, 10, 11, 12, 13, 14, 15	relexpind 14415	. . . . . . . . . 10 ⊢ (𝜂 → (𝑛 ∈ ℕ0 → (𝑆(𝑅↑𝑟𝑛)𝑋 → 𝜏)))
17	5, 6, 7, 16	syl3c 66	. . . . . . . . 9 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝜏)
18	17	anassrs 471	. . . . . . . 8 ⊢ (((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝜏)
19	18	expcom 417	. . . . . . 7 ⊢ ((𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0) → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏))
20	19	expcom 417	. . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑆(𝑅↑𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏)))
21	20	rexlimiv 3239	. . . . 5 ⊢ (∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏))
22	4, 21	mpcom 38	. . . 4 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏)
23	22	expcom 417	. . 3 ⊢ (𝜂 → (𝑆(t*rec‘𝑅)𝑋 → 𝜏))
24		breq 5032	. . . 4 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → (𝑆(t*‘𝑅)𝑋 ↔ 𝑆(t*rec‘𝑅)𝑋))
25	24	imbi1d 345	. . 3 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → ((𝑆(t*‘𝑅)𝑋 → 𝜏) ↔ (𝑆(t*rec‘𝑅)𝑋 → 𝜏)))
26	23, 25	syl5ibr 249	. 2 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏)))
27	2, 26	mpcom 38	1 ⊢ (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3107   class class class wbr 5030  Rel wrel 5524  ‘cfv 6324  (class class class)co 7135  ℕ₀cn0 11885  t*crtcl 14337  ↑_𝑟crelexp 14370  t*reccrtrcl 14406

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-n0 11886  df-z 11970  df-uz 12232  df-seq 13365  df-rtrcl 14339  df-relexp 14371  df-rtrclrec 14407

This theorem is referenced by: (None)