MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rtrclind Structured version   Visualization version   GIF version

Theorem rtrclind 15092
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.
StepHypRef Expression
1 rtrclind.1 . . 3 (𝜂 → Rel 𝑅)
21dfrtrcl2 15089 . 2 (𝜂 → (t*‘𝑅) = (t*rec‘𝑅))
31dfrtrclrec2 15085 . . . . . 6 (𝜂 → (𝑆(t*rec‘𝑅)𝑋 ↔ ∃𝑛 ∈ ℕ0 𝑆(𝑅𝑟𝑛)𝑋))
43biimpac 483 . . . . 5 ((𝑆(t*rec‘𝑅)𝑋𝜂) → ∃𝑛 ∈ ℕ0 𝑆(𝑅𝑟𝑛)𝑋)
5 simprl 782 . . . . . . . . . 10 ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅𝑟𝑛)𝑋𝑛 ∈ ℕ0))) → 𝜂)
6 simprrr 793 . . . . . . . . . 10 ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅𝑟𝑛)𝑋𝑛 ∈ ℕ0))) → 𝑛 ∈ ℕ0)
7 simprrl 792 . . . . . . . . . 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 (𝜂 → (𝑗𝑅𝑥 → (𝜃𝜓)))
161, 8, 9, 10, 11, 12, 13, 14, 15relexpind 15091 . . . . . . . . . 10 (𝜂 → (𝑛 ∈ ℕ0 → (𝑆(𝑅𝑟𝑛)𝑋𝜏)))
175, 6, 7, 16syl3c 67 . . . . . . . . 9 ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅𝑟𝑛)𝑋𝑛 ∈ ℕ0))) → 𝜏)
1817anassrs 472 . . . . . . . 8 (((𝑆(t*rec‘𝑅)𝑋𝜂) ∧ (𝑆(𝑅𝑟𝑛)𝑋𝑛 ∈ ℕ0)) → 𝜏)
1918expcom 418 . . . . . . 7 ((𝑆(𝑅𝑟𝑛)𝑋𝑛 ∈ ℕ0) → ((𝑆(t*rec‘𝑅)𝑋𝜂) → 𝜏))
2019expcom 418 . . . . . 6 (𝑛 ∈ ℕ0 → (𝑆(𝑅𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋𝜂) → 𝜏)))
2120rexlimiv 3159 . . . . 5 (∃𝑛 ∈ ℕ0 𝑆(𝑅𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋𝜂) → 𝜏))
224, 21mpcom 39 . . . 4 ((𝑆(t*rec‘𝑅)𝑋𝜂) → 𝜏)
2322expcom 418 . . 3 (𝜂 → (𝑆(t*rec‘𝑅)𝑋𝜏))
24 breq 5107 . . . 4 ((t*‘𝑅) = (t*rec‘𝑅) → (𝑆(t*‘𝑅)𝑋𝑆(t*rec‘𝑅)𝑋))
2524imbi1d 344 . . 3 ((t*‘𝑅) = (t*rec‘𝑅) → ((𝑆(t*‘𝑅)𝑋𝜏) ↔ (𝑆(t*rec‘𝑅)𝑋𝜏)))
2623, 25imbitrrid 249 . 2 ((t*‘𝑅) = (t*rec‘𝑅) → (𝜂 → (𝑆(t*‘𝑅)𝑋𝜏)))
272, 26mpcom 39 1 (𝜂 → (𝑆(t*‘𝑅)𝑋𝜏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1563  wcel 2145  wrex 3089   class class class wbr 5105  Rel wrel 5657  cfv 6525  (class class class)co 7400  0cn0 12495  t*crtcl 15013  𝑟crelexp 15046  t*reccrtrcl 15082
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-er 8682  df-en 8932  df-dom 8933  df-sdom 8934  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-nn 12225  df-2 12294  df-n0 12496  df-z 12583  df-uz 12854  df-seq 14029  df-rtrcl 15015  df-relexp 15047  df-rtrclrec 15083
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator