Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rtrclreclem1 | Structured version Visualization version GIF version |
Description: The reflexive, transitive closure is indeed a closure. (Contributed by Drahflow, 12-Nov-2015.) (Revised by RP, 30-May-2020.) (Revised by AV, 12-Jul-2024.) |
Ref | Expression |
---|---|
rtrclreclem1.1 | ⊢ (𝜑 → 𝑅 ∈ 𝑉) |
Ref | Expression |
---|---|
rtrclreclem1 | ⊢ (𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1nn0 11955 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
2 | ssidd 3917 | . . . . . 6 ⊢ (𝜑 → 𝑅 ⊆ 𝑅) | |
3 | rtrclreclem1.1 | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
4 | 3 | relexp1d 14441 | . . . . . 6 ⊢ (𝜑 → (𝑅↑𝑟1) = 𝑅) |
5 | 2, 4 | sseqtrrd 3935 | . . . . 5 ⊢ (𝜑 → 𝑅 ⊆ (𝑅↑𝑟1)) |
6 | oveq2 7163 | . . . . . . 7 ⊢ (𝑛 = 1 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟1)) | |
7 | 6 | sseq2d 3926 | . . . . . 6 ⊢ (𝑛 = 1 → (𝑅 ⊆ (𝑅↑𝑟𝑛) ↔ 𝑅 ⊆ (𝑅↑𝑟1))) |
8 | 7 | rspcev 3543 | . . . . 5 ⊢ ((1 ∈ ℕ0 ∧ 𝑅 ⊆ (𝑅↑𝑟1)) → ∃𝑛 ∈ ℕ0 𝑅 ⊆ (𝑅↑𝑟𝑛)) |
9 | 1, 5, 8 | sylancr 590 | . . . 4 ⊢ (𝜑 → ∃𝑛 ∈ ℕ0 𝑅 ⊆ (𝑅↑𝑟𝑛)) |
10 | ssiun 4938 | . . . 4 ⊢ (∃𝑛 ∈ ℕ0 𝑅 ⊆ (𝑅↑𝑟𝑛) → 𝑅 ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ (𝜑 → 𝑅 ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
12 | eqidd 2759 | . . . 4 ⊢ (𝜑 → (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))) | |
13 | oveq1 7162 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
14 | 13 | iuneq2d 4915 | . . . . 5 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
15 | 14 | adantl 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑟 = 𝑅) → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
16 | 3 | elexd 3430 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ V) |
17 | nn0ex 11945 | . . . . . 6 ⊢ ℕ0 ∈ V | |
18 | ovex 7188 | . . . . . 6 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
19 | 17, 18 | iunex 7678 | . . . . 5 ⊢ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V |
20 | 19 | a1i 11 | . . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V) |
21 | 12, 15, 16, 20 | fvmptd 6770 | . . 3 ⊢ (𝜑 → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
22 | 11, 21 | sseqtrrd 3935 | . 2 ⊢ (𝜑 → 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)) |
23 | df-rtrclrec 14468 | . . 3 ⊢ t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) | |
24 | fveq1 6661 | . . . . 5 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (t*rec‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)) | |
25 | 24 | sseq2d 3926 | . . . 4 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (𝑅 ⊆ (t*rec‘𝑅) ↔ 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))) |
26 | 25 | imbi2d 344 | . . 3 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → ((𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) ↔ (𝜑 → 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)))) |
27 | 23, 26 | ax-mp 5 | . 2 ⊢ ((𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) ↔ (𝜑 → 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))) |
28 | 22, 27 | mpbir 234 | 1 ⊢ (𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 = wceq 1538 ∈ wcel 2111 ∃wrex 3071 Vcvv 3409 ⊆ wss 3860 ∪ ciun 4886 ↦ cmpt 5115 ‘cfv 6339 (class class class)co 7155 1c1 10581 ℕ0cn0 11939 ↑𝑟crelexp 14431 t*reccrtrcl 14467 |
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 2729 ax-rep 5159 ax-sep 5172 ax-nul 5179 ax-pow 5237 ax-pr 5301 ax-un 7464 ax-cnex 10636 ax-resscn 10637 ax-1cn 10638 ax-icn 10639 ax-addcl 10640 ax-addrcl 10641 ax-mulcl 10642 ax-mulrcl 10643 ax-mulcom 10644 ax-addass 10645 ax-mulass 10646 ax-distr 10647 ax-i2m1 10648 ax-1ne0 10649 ax-1rid 10650 ax-rnegex 10651 ax-rrecex 10652 ax-cnre 10653 ax-pre-lttri 10654 ax-pre-lttrn 10655 ax-pre-ltadd 10656 ax-pre-mulgt0 10657 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-nel 3056 df-ral 3075 df-rex 3076 df-reu 3077 df-rab 3079 df-v 3411 df-sbc 3699 df-csb 3808 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-pss 3879 df-nul 4228 df-if 4424 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4802 df-iun 4888 df-br 5036 df-opab 5098 df-mpt 5116 df-tr 5142 df-id 5433 df-eprel 5438 df-po 5446 df-so 5447 df-fr 5486 df-we 5488 df-xp 5533 df-rel 5534 df-cnv 5535 df-co 5536 df-dm 5537 df-rn 5538 df-res 5539 df-ima 5540 df-pred 6130 df-ord 6176 df-on 6177 df-lim 6178 df-suc 6179 df-iota 6298 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7585 df-2nd 7699 df-wrecs 7962 df-recs 8023 df-rdg 8061 df-er 8304 df-en 8533 df-dom 8534 df-sdom 8535 df-pnf 10720 df-mnf 10721 df-xr 10722 df-ltxr 10723 df-le 10724 df-sub 10915 df-neg 10916 df-nn 11680 df-n0 11940 df-z 12026 df-uz 12288 df-seq 13424 df-relexp 14432 df-rtrclrec 14468 |
This theorem is referenced by: dfrtrcl2 14474 |
Copyright terms: Public domain | W3C validator |