Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rtrclreclem2 | 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.) |
Ref | Expression |
---|---|
rtrclreclem.ex | ⊢ (𝜑 → 𝑅 ∈ V) |
Ref | Expression |
---|---|
rtrclreclem2 | ⊢ (𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1nn0 11916 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
2 | ssidd 3993 | . . . . . 6 ⊢ (𝜑 → 𝑅 ⊆ 𝑅) | |
3 | rtrclreclem.ex | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V) | |
4 | 3 | relexp1d 14393 | . . . . . 6 ⊢ (𝜑 → (𝑅↑𝑟1) = 𝑅) |
5 | 2, 4 | sseqtrrd 4011 | . . . . 5 ⊢ (𝜑 → 𝑅 ⊆ (𝑅↑𝑟1)) |
6 | oveq2 7167 | . . . . . . 7 ⊢ (𝑛 = 1 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟1)) | |
7 | 6 | sseq2d 4002 | . . . . . 6 ⊢ (𝑛 = 1 → (𝑅 ⊆ (𝑅↑𝑟𝑛) ↔ 𝑅 ⊆ (𝑅↑𝑟1))) |
8 | 7 | rspcev 3626 | . . . . 5 ⊢ ((1 ∈ ℕ0 ∧ 𝑅 ⊆ (𝑅↑𝑟1)) → ∃𝑛 ∈ ℕ0 𝑅 ⊆ (𝑅↑𝑟𝑛)) |
9 | 1, 5, 8 | sylancr 589 | . . . 4 ⊢ (𝜑 → ∃𝑛 ∈ ℕ0 𝑅 ⊆ (𝑅↑𝑟𝑛)) |
10 | ssiun 4973 | . . . 4 ⊢ (∃𝑛 ∈ ℕ0 𝑅 ⊆ (𝑅↑𝑟𝑛) → 𝑅 ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ (𝜑 → 𝑅 ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
12 | eqidd 2825 | . . . 4 ⊢ (𝜑 → (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))) | |
13 | oveq1 7166 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛)) | |
14 | 13 | iuneq2d 4951 | . . . . 5 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
15 | 14 | adantl 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑟 = 𝑅) → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
16 | nn0ex 11906 | . . . . . 6 ⊢ ℕ0 ∈ V | |
17 | ovex 7192 | . . . . . 6 ⊢ (𝑅↑𝑟𝑛) ∈ V | |
18 | 16, 17 | iunex 7672 | . . . . 5 ⊢ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V |
19 | 18 | a1i 11 | . . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V) |
20 | 12, 15, 3, 19 | fvmptd 6778 | . . 3 ⊢ (𝜑 → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)) |
21 | 11, 20 | sseqtrrd 4011 | . 2 ⊢ (𝜑 → 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)) |
22 | df-rtrclrec 14418 | . . 3 ⊢ t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) | |
23 | fveq1 6672 | . . . . 5 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (t*rec‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)) | |
24 | 23 | sseq2d 4002 | . . . 4 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (𝑅 ⊆ (t*rec‘𝑅) ↔ 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))) |
25 | 24 | imbi2d 343 | . . 3 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → ((𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) ↔ (𝜑 → 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)))) |
26 | 22, 25 | ax-mp 5 | . 2 ⊢ ((𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) ↔ (𝜑 → 𝑅 ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))) |
27 | 21, 26 | mpbir 233 | 1 ⊢ (𝜑 → 𝑅 ⊆ (t*rec‘𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1536 ∈ wcel 2113 ∃wrex 3142 Vcvv 3497 ⊆ wss 3939 ∪ ciun 4922 ↦ cmpt 5149 ‘cfv 6358 (class class class)co 7159 1c1 10541 ℕ0cn0 11900 ↑𝑟crelexp 14382 t*reccrtrcl 14417 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-n0 11901 df-z 11985 df-uz 12247 df-seq 13373 df-relexp 14383 df-rtrclrec 14418 |
This theorem is referenced by: dfrtrcl2 14424 |
Copyright terms: Public domain | W3C validator |