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

Theorem rtrclreclem2 15212
Description: The reflexive, transitive closure is indeed reflexive. (Contributed by Drahflow, 12-Nov-2015.) (Revised by RP, 30-May-2020.) (Revised by AV, 13-Jul-2024.)
Hypotheses
Ref Expression
rtrclreclem2.1 (𝜑 → Rel 𝑅)
rtrclreclem2.2 (𝜑 → 𝑅 ∈ 𝑉)
Assertion
Ref Expression
rtrclreclem2 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (t*rec‘𝑅))

Proof of Theorem rtrclreclem2
Dummy variables 𝑟 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0nn0 12621 . . . . 5 0 ∈ ℕ0
2 ssid 3953 . . . . . 6 ( I ↾ ∪ ∪ 𝑅) ⊆ ( I ↾ ∪ ∪ 𝑅)
3 rtrclreclem2.1 . . . . . . 7 (𝜑 → Rel 𝑅)
4 rtrclreclem2.2 . . . . . . 7 (𝜑 → 𝑅 ∈ 𝑉)
53, 4relexp0d 15177 . . . . . 6 (𝜑 → (𝑅↑𝑟0) = ( I ↾ ∪ ∪ 𝑅))
62, 5sseqtrrid 3974 . . . . 5 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟0))
7 oveq2 7428 . . . . . . 7 (𝑛 = 0 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟0))
87sseq2d 3963 . . . . . 6 (𝑛 = 0 → (( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛) ↔ ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟0)))
98rspcev 3577 . . . . 5 ((0 ∈ ℕ0 ∧ ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟0)) → ∃𝑛 ∈ ℕ0 ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛))
101, 6, 9sylancr 599 . . . 4 (𝜑 → ∃𝑛 ∈ ℕ0 ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛))
11 ssiun 5005 . . . 4 (∃𝑛 ∈ ℕ0 ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛) → ( I ↾ ∪ ∪ 𝑅) ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
1210, 11syl 18 . . 3 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
134elexd 3474 . . . 4 (𝜑 → 𝑅 ∈ V)
14 nn0ex 12612 . . . . 5 ℕ0 ∈ V
15 ovex 7453 . . . . 5 (𝑅↑𝑟𝑛) ∈ V
1614, 15iunex 7980 . . . 4 ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V
17 oveq1 7427 . . . . . 6 (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛))
1817iuneq2d 4981 . . . . 5 (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
19 eqid 2761 . . . . 5 (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))
2018, 19fvmptg 6991 . . . 4 ((𝑅 ∈ V ∧ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V) → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
2113, 16, 20sylancl 598 . . 3 (𝜑 → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
2212, 21sseqtrrd 3968 . 2 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))
23 df-rtrclrec 15209 . . 3 t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))
24 fveq1 6884 . . . . 5 (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (t*rec‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))
2524sseq2d 3963 . . . 4 (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (( I ↾ ∪ ∪ 𝑅) ⊆ (t*rec‘𝑅) ↔ ( I ↾ ∪ ∪ 𝑅) ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)))
2625imbi2d 343 . . 3 (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → ((𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (t*rec‘𝑅)) ↔ (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))))
2723, 26ax-mp 5 . 2 ((𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (t*rec‘𝑅)) ↔ (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)))
2822, 27mpbir 234 1 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (t*rec‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  ∪ cuni 4867  ∪ ciun 4951   ↦ cmpt 5186   I cid 5545   ↾ cres 5653  Rel wrel 5656  ‘cfv 6538  (class class class)co 7420  0cc0 11200  ℕ0cn0 12606  ↑𝑟crelexp 15172  t*reccrtrcl 15208
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-mulcl 11262  ax-i2m1 11268
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-nn 12336  df-n0 12607  df-relexp 15173  df-rtrclrec 15209
This theorem is used by:  dfrtrcl2  15215
  Copyright terms: Public domain W3C validator