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

Theorem rtrclreclem2 15255
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 12661 . . . . 5 0 ∈ ℕ0
2 ssid 3935 . . . . . 6 ( I ↾ ∪ ∪ 𝑅) ⊆ ( I ↾ ∪ ∪ 𝑅)
3 rtrclreclem2.1 . . . . . . 7 (𝜑 → Rel 𝑅)
4 rtrclreclem2.2 . . . . . . 7 (𝜑 → 𝑅 ∈ 𝑉)
53, 4relexp0d 15220 . . . . . 6 (𝜑 → (𝑅↑𝑟0) = ( I ↾ ∪ ∪ 𝑅))
62, 5sseqtrrid 3956 . . . . 5 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟0))
7 oveq2 7459 . . . . . . 7 (𝑛 = 0 → (𝑅↑𝑟𝑛) = (𝑅↑𝑟0))
87sseq2d 3945 . . . . . 6 (𝑛 = 0 → (( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛) ↔ ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟0)))
98rspcev 3580 . . . . 5 ((0 ∈ ℕ0 ∧ ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟0)) → ∃𝑛 ∈ ℕ0 ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛))
101, 6, 9sylancr 599 . . . 4 (𝜑 → ∃𝑛 ∈ ℕ0 ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛))
11 ssiun 5010 . . . 4 (∃𝑛 ∈ ℕ0 ( I ↾ ∪ ∪ 𝑅) ⊆ (𝑅↑𝑟𝑛) → ( I ↾ ∪ ∪ 𝑅) ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
1210, 11syl 18 . . 3 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
134elexd 3477 . . . 4 (𝜑 → 𝑅 ∈ V)
14 nn0ex 12652 . . . . 5 ℕ0 ∈ V
15 ovex 7484 . . . . 5 (𝑅↑𝑟𝑛) ∈ V
1614, 15iunex 8014 . . . 4 ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V
17 oveq1 7458 . . . . . 6 (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛))
1817iuneq2d 4986 . . . . 5 (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
19 eqid 2763 . . . . 5 (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))
2018, 19fvmptg 7022 . . . 4 ((𝑅 ∈ V ∧ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V) → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
2113, 16, 20sylancl 598 . . 3 (𝜑 → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
2212, 21sseqtrrd 3950 . 2 (𝜑 → ( I ↾ ∪ ∪ 𝑅) ⊆ ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))
23 df-rtrclrec 15252 . . 3 t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))
24 fveq1 6915 . . . . 5 (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (t*rec‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))
2524sseq2d 3945 . . . 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 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872  ∪ ciun 4956   ↦ cmpt 5192   I cid 5552   ↾ cres 5660  Rel wrel 5663  ‘cfv 6566  (class class class)co 7451  0cc0 11239  ℕ0cn0 12646  ↑𝑟crelexp 15215  t*reccrtrcl 15251
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-mulcl 11301  ax-i2m1 11307
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-nn 12376  df-n0 12647  df-relexp 15216  df-rtrclrec 15252
This theorem is used by:  dfrtrcl2  15258
  Copyright terms: Public domain W3C validator