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

Theorem frrlem16 9798
Description: Lemma for general well-founded recursion. Establish a subset relation. (Contributed by Scott Fenton, 11-Sep-2023.) Revised notion of transitive closure. (Revised by Scott Fenton, 1-Dec-2024.)
Assertion
Ref Expression
frrlem16 (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) → ∀𝑤 ∈ Pred (t++(𝑅 ↾ 𝐴), 𝐴, 𝑧)Pred(𝑅, 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
Distinct variable groups:   𝑤,𝑅,𝑧   𝑤,𝐴,𝑧

Proof of Theorem frrlem16
StepHypRef Expression
1 predres 6367 . . . . . 6 Pred(𝑅, 𝐴, 𝑤) = Pred((𝑅 ↾ 𝐴), 𝐴, 𝑤)
2 relres 6011 . . . . . . . 8 Rel (𝑅 ↾ 𝐴)
3 ssttrcl 9752 . . . . . . . 8 (Rel (𝑅 ↾ 𝐴) → (𝑅 ↾ 𝐴) ⊆ t++(𝑅 ↾ 𝐴))
42, 3ax-mp 5 . . . . . . 7 (𝑅 ↾ 𝐴) ⊆ t++(𝑅 ↾ 𝐴)
5 predrelss 6365 . . . . . . 7 ((𝑅 ↾ 𝐴) ⊆ t++(𝑅 ↾ 𝐴) → Pred((𝑅 ↾ 𝐴), 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑤))
64, 5ax-mp 5 . . . . . 6 Pred((𝑅 ↾ 𝐴), 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑤)
71, 6eqsstri 3958 . . . . 5 Pred(𝑅, 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑤)
8 inss1 4135 . . . . . . . . 9 (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ⊆ t++(𝑅 ↾ 𝐴)
9 coss1 5842 . . . . . . . . 9 ((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ⊆ t++(𝑅 ↾ 𝐴) → ((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ (t++(𝑅 ↾ 𝐴) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))))
108, 9ax-mp 5 . . . . . . . 8 ((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ (t++(𝑅 ↾ 𝐴) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)))
11 coss2 5843 . . . . . . . . 9 ((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ⊆ t++(𝑅 ↾ 𝐴) → (t++(𝑅 ↾ 𝐴) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ (t++(𝑅 ↾ 𝐴) ∘ t++(𝑅 ↾ 𝐴)))
128, 11ax-mp 5 . . . . . . . 8 (t++(𝑅 ↾ 𝐴) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ (t++(𝑅 ↾ 𝐴) ∘ t++(𝑅 ↾ 𝐴))
1310, 12sstri 3921 . . . . . . 7 ((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ (t++(𝑅 ↾ 𝐴) ∘ t++(𝑅 ↾ 𝐴))
14 ttrcltr 9753 . . . . . . 7 (t++(𝑅 ↾ 𝐴) ∘ t++(𝑅 ↾ 𝐴)) ⊆ t++(𝑅 ↾ 𝐴)
1513, 14sstri 3921 . . . . . 6 ((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ t++(𝑅 ↾ 𝐴)
16 predtrss 6350 . . . . . 6 ((((t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴)) ∘ (t++(𝑅 ↾ 𝐴) ∩ (𝐴 × 𝐴))) ⊆ t++(𝑅 ↾ 𝐴) ∧ 𝑤 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧) ∧ 𝑧 ∈ 𝐴) → Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
1715, 16mp3an1 1480 . . . . 5 ((𝑤 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧) ∧ 𝑧 ∈ 𝐴) → Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
187, 17sstrid 3923 . . . 4 ((𝑤 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧) ∧ 𝑧 ∈ 𝐴) → Pred(𝑅, 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
1918ancoms 464 . . 3 ((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧)) → Pred(𝑅, 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
2019ralrimiva 3161 . 2 (𝑧 ∈ 𝐴 → ∀𝑤 ∈ Pred (t++(𝑅 ↾ 𝐴), 𝐴, 𝑧)Pred(𝑅, 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
2120adantl 487 1 (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑧 ∈ 𝐴) → ∀𝑤 ∈ Pred (t++(𝑅 ↾ 𝐴), 𝐴, 𝑧)Pred(𝑅, 𝐴, 𝑤) ⊆ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑧))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2150  ∀wral 3083   ⊆ wss 3899   ∩ cin 4091   Fr wfr 5607   Se wse 5608   × cxp 5655   ↾ cres 5659   ∘ ccom 5661  Rel wrel 5662  Predcpred 6328  t++cttrcl 9744
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-oadd 8517  df-ttrcl 9745
This theorem is used by:  frr1  9799
  Copyright terms: Public domain W3C validator