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

Theorem ttrclse 9765
Description: If 𝑅 is set-like over 𝐴, then the transitive closure of the restriction of 𝑅 to 𝐴 is set-like over 𝐴.

This theorem requires the axioms of infinity and replacement for its proof. (Contributed by Scott Fenton, 31-Oct-2024.)

Assertion
Ref Expression
ttrclse (𝑅 Se 𝐴 → t++(𝑅 ↾ 𝐴) Se 𝐴)

Proof of Theorem ttrclse
Dummy variables 𝑎 𝑏 𝑓 𝑛 𝑤 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brttrcl2 9752 . . . . . . 7 (𝑦t++(𝑅 ↾ 𝐴)𝑥 ↔ ∃𝑛 ∈ ω ∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)))
2 eqid 2763 . . . . . . . . . . 11 rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) = rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))
32ttrclselem2 9764 . . . . . . . . . 10 ((𝑛 ∈ ω ∧ 𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
433expb 1138 . . . . . . . . 9 ((𝑛 ∈ ω ∧ (𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴)) → (∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
54ancoms 464 . . . . . . . 8 (((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ ω) → (∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
65rexbidva 3188 . . . . . . 7 ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (∃𝑛 ∈ ω ∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
71, 6bitrid 286 . . . . . 6 ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦t++(𝑅 ↾ 𝐴)𝑥 ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
8 vex 3458 . . . . . . . . 9 𝑦 ∈ V
98elpred 6347 . . . . . . . 8 (𝑥 ∈ V → (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦t++(𝑅 ↾ 𝐴)𝑥)))
109elv 3459 . . . . . . 7 (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦t++(𝑅 ↾ 𝐴)𝑥))
11 resdmss 6255 . . . . . . . . 9 dom (𝑅 ↾ 𝐴) ⊆ 𝐴
12 vex 3458 . . . . . . . . . . 11 𝑥 ∈ V
138, 12breldm 5902 . . . . . . . . . 10 (𝑦t++(𝑅 ↾ 𝐴)𝑥 → 𝑦 ∈ dom t++(𝑅 ↾ 𝐴))
14 dmttrcl 9759 . . . . . . . . . 10 dom t++(𝑅 ↾ 𝐴) = dom (𝑅 ↾ 𝐴)
1513, 14eleqtrdi 2874 . . . . . . . . 9 (𝑦t++(𝑅 ↾ 𝐴)𝑥 → 𝑦 ∈ dom (𝑅 ↾ 𝐴))
1611, 15sselid 3911 . . . . . . . 8 (𝑦t++(𝑅 ↾ 𝐴)𝑥 → 𝑦 ∈ 𝐴)
1716pm4.71ri 570 . . . . . . 7 (𝑦t++(𝑅 ↾ 𝐴)𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦t++(𝑅 ↾ 𝐴)𝑥))
1810, 17bitr4i 281 . . . . . 6 (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ 𝑦t++(𝑅 ↾ 𝐴)𝑥)
19 rdgfun 8462 . . . . . . 7 Fun rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))
20 eluniima 7285 . . . . . . 7 (Fun rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) → (𝑦 ∈ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
2119, 20ax-mp 5 . . . . . 6 (𝑦 ∈ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛))
227, 18, 213bitr4g 317 . . . . 5 ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ 𝑦 ∈ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω)))
2322eqrdv 2761 . . . 4 ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) = ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω))
24 omex 9681 . . . . . . 7 ω ∈ V
2524funimaex 6657 . . . . . 6 (Fun rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) → (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ∈ V)
2619, 25ax-mp 5 . . . . 5 (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ∈ V
2726uniex 7790 . . . 4 ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ∈ V
2823, 27eqeltrdi 2872 . . 3 ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ∈ V)
2928ralrimiva 3158 . 2 (𝑅 Se 𝐴 → ∀𝑥 ∈ 𝐴 Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ∈ V)
30 dfse3 6365 . 2 (t++(𝑅 ↾ 𝐴) Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ∈ V)
3129, 30sylibr 237 1 (𝑅 Se 𝐴 → t++(𝑅 ↾ 𝐴) Se 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454  ∅c0 4281  ∪ cuni 4872  ∪ ciun 4956   class class class wbr 5108   ↦ cmpt 5192   Se wse 5609  dom cdm 5658   ↾ cres 5660   “ cima 5661  Predcpred 6329  suc csuc 6390  Fun wfun 6560   Fn wfn 6561  ‘cfv 6566  ωcom 7911  reccrdg 8455  t++cttrcl 9745
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-pr 5398  ax-un 7783  ax-inf2 9679
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-int 4913  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-se 5612  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-1o 8514  df-oadd 8518  df-ttrcl 9746
This theorem is used by:  frmin  9790  frr1  9800
  Copyright terms: Public domain W3C validator