![]() |
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 four 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.) |
Ref | Expression |
---|---|
rtrclind.1 | ⊢ (𝜂 → Rel 𝑅) |
rtrclind.2 | ⊢ (𝜂 → 𝑅 ∈ V) |
rtrclind.3 | ⊢ (𝜂 → 𝑆 ∈ V) |
rtrclind.4 | ⊢ (𝜂 → 𝑋 ∈ V) |
rtrclind.5 | ⊢ (𝑖 = 𝑆 → (𝜑 ↔ 𝜒)) |
rtrclind.6 | ⊢ (𝑖 = 𝑥 → (𝜑 ↔ 𝜓)) |
rtrclind.7 | ⊢ (𝑖 = 𝑗 → (𝜑 ↔ 𝜃)) |
rtrclind.8 | ⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜏)) |
rtrclind.9 | ⊢ (𝜂 → 𝜒) |
rtrclind.10 | ⊢ (𝜂 → (𝑗𝑅𝑥 → (𝜃 → 𝜓))) |
Ref | Expression |
---|---|
rtrclind | ⊢ (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rtrclind.1 | . . 3 ⊢ (𝜂 → Rel 𝑅) | |
2 | rtrclind.2 | . . 3 ⊢ (𝜂 → 𝑅 ∈ V) | |
3 | 1, 2 | dfrtrcl2 13650 | . 2 ⊢ (𝜂 → (t*‘𝑅) = (t*rec‘𝑅)) |
4 | 1, 2 | dfrtrclrec2 13645 | . . . . . 6 ⊢ (𝜂 → (𝑆(t*rec‘𝑅)𝑋 ↔ ∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋)) |
5 | 4 | biimpac 502 | . . . . 5 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → ∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋) |
6 | simprl 790 | . . . . . . . . . 10 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝜂) | |
7 | simprrr 801 | . . . . . . . . . 10 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝑛 ∈ ℕ0) | |
8 | simprrl 800 | . . . . . . . . . 10 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝑆(𝑅↑𝑟𝑛)𝑋) | |
9 | rtrclind.3 | . . . . . . . . . . 11 ⊢ (𝜂 → 𝑆 ∈ V) | |
10 | rtrclind.4 | . . . . . . . . . . 11 ⊢ (𝜂 → 𝑋 ∈ V) | |
11 | rtrclind.5 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝑆 → (𝜑 ↔ 𝜒)) | |
12 | rtrclind.6 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝑥 → (𝜑 ↔ 𝜓)) | |
13 | rtrclind.7 | . . . . . . . . . . 11 ⊢ (𝑖 = 𝑗 → (𝜑 ↔ 𝜃)) | |
14 | rtrclind.8 | . . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜏)) | |
15 | rtrclind.9 | . . . . . . . . . . 11 ⊢ (𝜂 → 𝜒) | |
16 | rtrclind.10 | . . . . . . . . . . 11 ⊢ (𝜂 → (𝑗𝑅𝑥 → (𝜃 → 𝜓))) | |
17 | 1, 2, 9, 10, 11, 12, 13, 14, 15, 16 | relexpind 13652 | . . . . . . . . . 10 ⊢ (𝜂 → (𝑛 ∈ ℕ0 → (𝑆(𝑅↑𝑟𝑛)𝑋 → 𝜏))) |
18 | 6, 7, 8, 17 | syl3c 64 | . . . . . . . . 9 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ (𝜂 ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0))) → 𝜏) |
19 | 18 | anassrs 678 | . . . . . . . 8 ⊢ (((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) ∧ (𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝜏) |
20 | 19 | expcom 450 | . . . . . . 7 ⊢ ((𝑆(𝑅↑𝑟𝑛)𝑋 ∧ 𝑛 ∈ ℕ0) → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏)) |
21 | 20 | expcom 450 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑆(𝑅↑𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏))) |
22 | 21 | rexlimiv 3009 | . . . . 5 ⊢ (∃𝑛 ∈ ℕ0 𝑆(𝑅↑𝑟𝑛)𝑋 → ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏)) |
23 | 5, 22 | mpcom 37 | . . . 4 ⊢ ((𝑆(t*rec‘𝑅)𝑋 ∧ 𝜂) → 𝜏) |
24 | 23 | expcom 450 | . . 3 ⊢ (𝜂 → (𝑆(t*rec‘𝑅)𝑋 → 𝜏)) |
25 | breq 4585 | . . . 4 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → (𝑆(t*‘𝑅)𝑋 ↔ 𝑆(t*rec‘𝑅)𝑋)) | |
26 | 25 | imbi1d 330 | . . 3 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → ((𝑆(t*‘𝑅)𝑋 → 𝜏) ↔ (𝑆(t*rec‘𝑅)𝑋 → 𝜏))) |
27 | 24, 26 | syl5ibr 235 | . 2 ⊢ ((t*‘𝑅) = (t*rec‘𝑅) → (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏))) |
28 | 3, 27 | mpcom 37 | 1 ⊢ (𝜂 → (𝑆(t*‘𝑅)𝑋 → 𝜏)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 Vcvv 3173 class class class wbr 4583 Rel wrel 5043 ‘cfv 5804 (class class class)co 6549 ℕ0cn0 11169 t*crtcl 13573 ↑𝑟crelexp 13608 t*reccrtrcl 13643 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-n0 11170 df-z 11255 df-uz 11564 df-seq 12664 df-rtrcl 13575 df-relexp 13609 df-rtrclrec 13644 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |