Theorem dfrtrclrec2 14876

Description: If two elements are connected by a reflexive, transitive closure, then they are connected via 𝑛 instances the relation, for some 𝑛. (Contributed by Drahflow, 12-Nov-2015.) (Revised by AV, 13-Jul-2024.)

Hypothesis

Ref	Expression
dfrtrclrec2.1	⊢ (𝜑 → Rel 𝑅)

Assertion

Ref	Expression
dfrtrclrec2	⊢ (𝜑 → (𝐴(t*rec‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵))

Distinct variable groups:   𝑅,𝑛   𝐴,𝑛   𝐵,𝑛

Allowed substitution hint:   𝜑(𝑛)

Proof of Theorem dfrtrclrec2

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑅 ∈ V)
2		nn0ex 12352	. . . . . . 7 ⊢ ℕ0 ∈ V
3		ovex 7382	. . . . . . 7 ⊢ (𝑅↑𝑟𝑛) ∈ V
4	2, 3	iunex 7891	. . . . . 6 ⊢ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V
5		oveq1 7356	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑟↑𝑟𝑛) = (𝑅↑𝑟𝑛))
6	5	iuneq2d 4981	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
7		eqid 2737	. . . . . . 7 ⊢ (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))
8	6, 7	fvmptg 6941	. . . . . 6 ⊢ ((𝑅 ∈ V ∧ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∈ V) → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
9	1, 4, 8	sylancl 587	. . . . 5 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
10	9	ex 414	. . . 4 ⊢ (𝜑 → (𝑅 ∈ V → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)))
11		iun0 5020	. . . . . 6 ⊢ ∪ 𝑛 ∈ ℕ0 ∅ = ∅
12	11	a1i 11	. . . . 5 ⊢ (¬ 𝑅 ∈ V → ∪ 𝑛 ∈ ℕ0 ∅ = ∅)
13		reldmrelexp 14839	. . . . . . 7 ⊢ Rel dom ↑𝑟
14	13	ovprc1 7388	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → (𝑅↑𝑟𝑛) = ∅)
15	14	iuneq2d 4981	. . . . 5 ⊢ (¬ 𝑅 ∈ V → ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) = ∪ 𝑛 ∈ ℕ0 ∅)
16		fvprc 6829	. . . . 5 ⊢ (¬ 𝑅 ∈ V → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∅)
17	12, 15, 16	3eqtr4rd 2788	. . . 4 ⊢ (¬ 𝑅 ∈ V → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
18	10, 17	pm2.61d1 180	. . 3 ⊢ (𝜑 → ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
19		breq 5105	. . . 4 ⊢ (((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) → (𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵 ↔ 𝐴∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)𝐵))
20		eliun 4956	. . . . . 6 ⊢ (⟨𝐴, 𝐵⟩ ∈ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ↔ ∃𝑛 ∈ ℕ0 ⟨𝐴, 𝐵⟩ ∈ (𝑅↑𝑟𝑛))
21	20	a1i 11	. . . . 5 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ↔ ∃𝑛 ∈ ℕ0 ⟨𝐴, 𝐵⟩ ∈ (𝑅↑𝑟𝑛)))
22		df-br 5104	. . . . 5 ⊢ (𝐴∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛))
23		df-br 5104	. . . . . 6 ⊢ (𝐴(𝑅↑𝑟𝑛)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑅↑𝑟𝑛))
24	23	rexbii 3095	. . . . 5 ⊢ (∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵 ↔ ∃𝑛 ∈ ℕ0 ⟨𝐴, 𝐵⟩ ∈ (𝑅↑𝑟𝑛))
25	21, 22, 24	3bitr4g 314	. . . 4 ⊢ (𝜑 → (𝐴∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵))
26	19, 25	sylan9bb 511	. . 3 ⊢ ((((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅) = ∪ 𝑛 ∈ ℕ0 (𝑅↑𝑟𝑛) ∧ 𝜑) → (𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵))
27	18, 26	mpancom 686	. 2 ⊢ (𝜑 → (𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵))
28		df-rtrclrec 14874	. . 3 ⊢ t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))
29		fveq1 6836	. . . . . 6 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (t*rec‘𝑅) = ((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅))
30	29	breqd 5114	. . . . 5 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → (𝐴(t*rec‘𝑅)𝐵 ↔ 𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵))
31	30	bibi1d 344	. . . 4 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → ((𝐴(t*rec‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵) ↔ (𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵)))
32	31	imbi2d 341	. . 3 ⊢ (t*rec = (𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛)) → ((𝜑 → (𝐴(t*rec‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵)) ↔ (𝜑 → (𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵))))
33	28, 32	ax-mp 5	. 2 ⊢ ((𝜑 → (𝐴(t*rec‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵)) ↔ (𝜑 → (𝐴((𝑟 ∈ V ↦ ∪ 𝑛 ∈ ℕ0 (𝑟↑𝑟𝑛))‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵)))
34	27, 33	mpbir 230	1 ⊢ (𝜑 → (𝐴(t*rec‘𝑅)𝐵 ↔ ∃𝑛 ∈ ℕ0 𝐴(𝑅↑𝑟𝑛)𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1541   ∈ wcel 2106  ∃wrex 3071  Vcvv 3443  ∅c0 4280  ⟨cop 4590  ∪ ciun 4952   class class class wbr 5103   ↦ cmpt 5186  Rel wrel 5635  ‘cfv 6491  (class class class)co 7349  ℕ₀cn0 12346  ↑_𝑟crelexp 14837  t*reccrtrcl 14873

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-rep 5240  ax-sep 5254  ax-nul 5261  ax-pr 5382  ax-un 7662  ax-cnex 11040  ax-1cn 11042  ax-addcl 11044

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-iun 4954  df-br 5104  df-opab 5166  df-mpt 5187  df-tr 5221  df-id 5528  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5585  df-we 5587  df-xp 5636  df-rel 5637  df-cnv 5638  df-co 5639  df-dm 5640  df-rn 5641  df-res 5642  df-ima 5643  df-pred 6249  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6443  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7793  df-2nd 7912  df-frecs 8179  df-wrecs 8210  df-recs 8284  df-rdg 8323  df-nn 12087  df-n0 12347  df-relexp 14838  df-rtrclrec 14874

This theorem is referenced by:  rtrclreclem3  14878  rtrclind  14883