Theorem ttrclse 9642

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.

Step	Hyp	Ref	Expression
1		brttrcl2 9629	. . . . . . 7 ⊢ (𝑦t++(𝑅 ↾ 𝐴)𝑥 ↔ ∃𝑛 ∈ ω ∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)))
2		eqid 2737	. . . . . . . . . . 11 ⊢ rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) = rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))
3	2	ttrclselem2 9641	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ω ∧ 𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
4	3	3expb 1121	. . . . . . . . 9 ⊢ ((𝑛 ∈ ω ∧ (𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴)) → (∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
5	4	ancoms 458	. . . . . . . 8 ⊢ (((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ ω) → (∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
6	5	rexbidva 3160	. . . . . . 7 ⊢ ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (∃𝑛 ∈ ω ∃𝑓(𝑓 Fn suc suc 𝑛 ∧ ((𝑓‘∅) = 𝑦 ∧ (𝑓‘suc 𝑛) = 𝑥) ∧ ∀𝑎 ∈ suc 𝑛(𝑓‘𝑎)(𝑅 ↾ 𝐴)(𝑓‘suc 𝑎)) ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
7	1, 6	bitrid 283	. . . . . 6 ⊢ ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦t++(𝑅 ↾ 𝐴)𝑥 ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
8		vex 3434	. . . . . . . . 9 ⊢ 𝑦 ∈ V
9	8	elpred 6277	. . . . . . . 8 ⊢ (𝑥 ∈ V → (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦t++(𝑅 ↾ 𝐴)𝑥)))
10	9	elv 3435	. . . . . . 7 ⊢ (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦t++(𝑅 ↾ 𝐴)𝑥))
11		resdmss 6194	. . . . . . . . 9 ⊢ dom (𝑅 ↾ 𝐴) ⊆ 𝐴
12		vex 3434	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
13	8, 12	breldm 5858	. . . . . . . . . 10 ⊢ (𝑦t++(𝑅 ↾ 𝐴)𝑥 → 𝑦 ∈ dom t++(𝑅 ↾ 𝐴))
14		dmttrcl 9636	. . . . . . . . . 10 ⊢ dom t++(𝑅 ↾ 𝐴) = dom (𝑅 ↾ 𝐴)
15	13, 14	eleqtrdi 2847	. . . . . . . . 9 ⊢ (𝑦t++(𝑅 ↾ 𝐴)𝑥 → 𝑦 ∈ dom (𝑅 ↾ 𝐴))
16	11, 15	sselid 3920	. . . . . . . 8 ⊢ (𝑦t++(𝑅 ↾ 𝐴)𝑥 → 𝑦 ∈ 𝐴)
17	16	pm4.71ri 560	. . . . . . 7 ⊢ (𝑦t++(𝑅 ↾ 𝐴)𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦t++(𝑅 ↾ 𝐴)𝑥))
18	10, 17	bitr4i 278	. . . . . 6 ⊢ (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ 𝑦t++(𝑅 ↾ 𝐴)𝑥)
19		rdgfun 8349	. . . . . . 7 ⊢ Fun rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))
20		eluniima 7199	. . . . . . 7 ⊢ (Fun rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) → (𝑦 ∈ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛)))
21	19, 20	ax-mp 5	. . . . . 6 ⊢ (𝑦 ∈ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ↔ ∃𝑛 ∈ ω 𝑦 ∈ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥))‘𝑛))
22	7, 18, 21	3bitr4g 314	. . . . 5 ⊢ ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ↔ 𝑦 ∈ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω)))
23	22	eqrdv 2735	. . . 4 ⊢ ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) = ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω))
24		omex 9558	. . . . . . 7 ⊢ ω ∈ V
25	24	funimaex 6581	. . . . . 6 ⊢ (Fun rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) → (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ∈ V)
26	19, 25	ax-mp 5	. . . . 5 ⊢ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ∈ V
27	26	uniex 7689	. . . 4 ⊢ ∪ (rec((𝑏 ∈ V ↦ ∪ 𝑤 ∈ 𝑏 Pred(𝑅, 𝐴, 𝑤)), Pred(𝑅, 𝐴, 𝑥)) “ ω) ∈ V
28	23, 27	eqeltrdi 2845	. . 3 ⊢ ((𝑅 Se 𝐴 ∧ 𝑥 ∈ 𝐴) → Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ∈ V)
29	28	ralrimiva 3130	. 2 ⊢ (𝑅 Se 𝐴 → ∀𝑥 ∈ 𝐴 Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ∈ V)
30		dfse3 6295	. 2 ⊢ (t++(𝑅 ↾ 𝐴) Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 Pred(t++(𝑅 ↾ 𝐴), 𝐴, 𝑥) ∈ V)
31	29, 30	sylibr 234	1 ⊢ (𝑅 Se 𝐴 → t++(𝑅 ↾ 𝐴) Se 𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  Vcvv 3430  ∅c0 4274  ∪ cuni 4851  ∪ ciun 4934   class class class wbr 5086   ↦ cmpt 5167   Se wse 5576  dom cdm 5625   ↾ cres 5627   “ cima 5628  Predcpred 6259  suc csuc 6320  Fun wfun 6487   Fn wfn 6488  ‘cfv 6493  ωcom 7811  reccrdg 8342  t++cttrcl 9622

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pr 5371  ax-un 7683  ax-inf2 9556

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-2nd 7937  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-oadd 8403  df-ttrcl 9623

This theorem is referenced by:  frmin  9667  frr1  9677