| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rtrclind | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| rtrclind.1 | ⊢ (𝜂 → Rel 𝑅) |
| rtrclind.2 | ⊢ (𝜂 → 𝑆 ∈ 𝑉) |
| rtrclind.3 | ⊢ (𝜂 → 𝑋 ∈ 𝑊) |
| rtrclind.4 | ⊢ (𝑖 = 𝑆 → (𝜑 ↔ 𝜒)) |
| rtrclind.5 | ⊢ (𝑖 = 𝑥 → (𝜑 ↔ 𝜓)) |
| rtrclind.6 | ⊢ (𝑖 = 𝑗 → (𝜑 ↔ 𝜃)) |
| rtrclind.7 | ⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜏)) |
| rtrclind.8 | ⊢ (𝜂 → 𝜒) |
| rtrclind.9 | ⊢ (𝜂 → (𝑗𝑅𝑥 → (𝜃 → 𝜓))) |
| Ref | Expression |
|---|---|
| rtrclind | ⊢ (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rtrclind.1 | . . 3 ⊢ (𝜂 → Rel 𝑅) | |
| 2 | 1 | dfrtrcl2 15101 | . 2 ⊢ (𝜂 → (t*‘𝑅) = (t*rec‘𝑅)) |
| 3 | 1 | dfrtrclrec2 15097 | . . . . . 6 ⊢ (𝜂 → (𝑆(t*rec‘𝑅)𝑋 ↔ ∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋)) |
| 4 | 3 | biimpac 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 ⊢ (𝜂 → (𝑗𝑅𝑥 → (𝜃 → 𝜓))) | |
| 16 | 1, 8, 9, 10, 11, 12, 13, 14, 15 | relexpind 15103 | . . . . . . . . . 10 ⊢ (𝜂 → (𝑛 ∈ ℕ0 → (𝑆(𝑅↑𝑟𝑛)𝑋 → 𝜏))) |
| 17 | 5, 6, 7, 16 | syl3c 67 | . . . . . . . . 9 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝜏) |
| 18 | 17 | anassrs 472 | . . . . . . . 8 ⊢ (((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝜏) |
| 19 | 18 | expcom 418 | . . . . . . 7 ⊢ ((𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0) → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏)) |
| 20 | 19 | expcom 418 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑆(𝑅↑𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏))) |
| 21 | 20 | rexlimiv 3159 | . . . . 5 ⊢ (∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏)) |
| 22 | 4, 21 | mpcom 39 | . . . 4 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏) |
| 23 | 22 | expcom 418 | . . 3 ⊢ (𝜂 → (𝑆(t*rec‘𝑅)𝑋 → 𝜏)) |
| 24 | breq 5112 | . . . 4 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → (𝑆(t*‘𝑅)𝑋 ↔ 𝑆(t*rec‘𝑅)𝑋)) | |
| 25 | 24 | imbi1d 344 | . . 3 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → ((𝑆(t*‘𝑅)𝑋 → 𝜏) ↔ (𝑆(t*rec‘𝑅)𝑋 → 𝜏))) |
| 26 | 23, 25 | imbitrrid 249 | . 2 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏))) |
| 27 | 2, 26 | mpcom 39 | 1 ⊢ (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 class class class wbr 5110 Rel wrel 5668 ‘cfv 6538 (class class class)co 7412 ℕ0cn0 12505 t*crtcl 15025 ↑𝑟crelexp 15058 t*reccrtrcl 15094 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-n0 12506 df-z 12593 df-uz 12864 df-seq 14040 df-rtrcl 15027 df-relexp 15059 df-rtrclrec 15095 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |