ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  freccllem GIF version

Theorem freccllem 6611
Description: Lemma for freccl 6612. Just giving a name to a common expression to simplify the proof. (Contributed by Jim Kingdon, 27-Mar-2022.)
Hypotheses
Ref Expression
freccl.a (𝜑𝐴𝑆)
freccl.cl ((𝜑𝑧𝑆) → (𝐹𝑧) ∈ 𝑆)
freccl.b (𝜑𝐵 ∈ ω)
freccllem.g 𝐺 = recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))}))
Assertion
Ref Expression
freccllem (𝜑 → (frec(𝐹, 𝐴)‘𝐵) ∈ 𝑆)
Distinct variable groups:   𝐴,𝑔,𝑚,𝑥   𝑧,𝐴,𝑚,𝑥   𝑥,𝐵   𝑔,𝐹,𝑚,𝑥   𝑧,𝐹   𝑆,𝑚,𝑥,𝑧   𝜑,𝑚,𝑥,𝑧
Allowed substitution hints:   𝜑(𝑔)   𝐵(𝑧,𝑔,𝑚)   𝑆(𝑔)   𝐺(𝑥,𝑧,𝑔,𝑚)

Proof of Theorem freccllem
Dummy variables 𝑓 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-frec 6600 . . . 4 frec(𝐹, 𝐴) = (recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})) ↾ ω)
2 freccllem.g . . . . 5 𝐺 = recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))}))
32reseq1i 5015 . . . 4 (𝐺 ↾ ω) = (recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})) ↾ ω)
41, 3eqtr4i 2255 . . 3 frec(𝐹, 𝐴) = (𝐺 ↾ ω)
54fveq1i 5649 . 2 (frec(𝐹, 𝐴)‘𝐵) = ((𝐺 ↾ ω)‘𝐵)
6 freccl.b . . . 4 (𝜑𝐵 ∈ ω)
7 fvres 5672 . . . 4 (𝐵 ∈ ω → ((𝐺 ↾ ω)‘𝐵) = (𝐺𝐵))
86, 7syl 14 . . 3 (𝜑 → ((𝐺 ↾ ω)‘𝐵) = (𝐺𝐵))
9 funmpt 5371 . . . . 5 Fun (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})
109a1i 9 . . . 4 (𝜑 → Fun (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))}))
11 ordom 4711 . . . . 5 Ord ω
1211a1i 9 . . . 4 (𝜑 → Ord ω)
13 vex 2806 . . . . . 6 𝑓 ∈ V
14 simp2 1025 . . . . . . 7 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → 𝑦 ∈ ω)
15 simp3 1026 . . . . . . 7 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → 𝑓:𝑦𝑆)
16 freccl.cl . . . . . . . . 9 ((𝜑𝑧𝑆) → (𝐹𝑧) ∈ 𝑆)
1716ralrimiva 2606 . . . . . . . 8 (𝜑 → ∀𝑧𝑆 (𝐹𝑧) ∈ 𝑆)
18173ad2ant1 1045 . . . . . . 7 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → ∀𝑧𝑆 (𝐹𝑧) ∈ 𝑆)
19 freccl.a . . . . . . . 8 (𝜑𝐴𝑆)
20193ad2ant1 1045 . . . . . . 7 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → 𝐴𝑆)
2114, 15, 18, 20frecabcl 6608 . . . . . 6 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥𝐴))} ∈ 𝑆)
22 dmeq 4937 . . . . . . . . . . . 12 (𝑔 = 𝑓 → dom 𝑔 = dom 𝑓)
2322eqeq1d 2240 . . . . . . . . . . 11 (𝑔 = 𝑓 → (dom 𝑔 = suc 𝑚 ↔ dom 𝑓 = suc 𝑚))
24 fveq1 5647 . . . . . . . . . . . . 13 (𝑔 = 𝑓 → (𝑔𝑚) = (𝑓𝑚))
2524fveq2d 5652 . . . . . . . . . . . 12 (𝑔 = 𝑓 → (𝐹‘(𝑔𝑚)) = (𝐹‘(𝑓𝑚)))
2625eleq2d 2301 . . . . . . . . . . 11 (𝑔 = 𝑓 → (𝑥 ∈ (𝐹‘(𝑔𝑚)) ↔ 𝑥 ∈ (𝐹‘(𝑓𝑚))))
2723, 26anbi12d 473 . . . . . . . . . 10 (𝑔 = 𝑓 → ((dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ↔ (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚)))))
2827rexbidv 2534 . . . . . . . . 9 (𝑔 = 𝑓 → (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ↔ ∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚)))))
2922eqeq1d 2240 . . . . . . . . . 10 (𝑔 = 𝑓 → (dom 𝑔 = ∅ ↔ dom 𝑓 = ∅))
3029anbi1d 465 . . . . . . . . 9 (𝑔 = 𝑓 → ((dom 𝑔 = ∅ ∧ 𝑥𝐴) ↔ (dom 𝑓 = ∅ ∧ 𝑥𝐴)))
3128, 30orbi12d 801 . . . . . . . 8 (𝑔 = 𝑓 → ((∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴)) ↔ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥𝐴))))
3231abbidv 2350 . . . . . . 7 (𝑔 = 𝑓 → {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))} = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥𝐴))})
33 eqid 2231 . . . . . . 7 (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))}) = (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})
3432, 33fvmptg 5731 . . . . . 6 ((𝑓 ∈ V ∧ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥𝐴))} ∈ 𝑆) → ((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})‘𝑓) = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥𝐴))})
3513, 21, 34sylancr 414 . . . . 5 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → ((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})‘𝑓) = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚𝑥 ∈ (𝐹‘(𝑓𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥𝐴))})
3635, 21eqeltrd 2308 . . . 4 ((𝜑𝑦 ∈ ω ∧ 𝑓:𝑦𝑆) → ((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚𝑥 ∈ (𝐹‘(𝑔𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥𝐴))})‘𝑓) ∈ 𝑆)
37 limom 4718 . . . . . . 7 Lim ω
38 limuni 4499 . . . . . . 7 (Lim ω → ω = ω)
3937, 38ax-mp 5 . . . . . 6 ω = ω
4039eleq2i 2298 . . . . 5 (𝑦 ∈ ω ↔ 𝑦 ω)
41 peano2 4699 . . . . . 6 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
4241adantl 277 . . . . 5 ((𝜑𝑦 ∈ ω) → suc 𝑦 ∈ ω)
4340, 42sylan2br 288 . . . 4 ((𝜑𝑦 ω) → suc 𝑦 ∈ ω)
446, 39eleqtrdi 2324 . . . 4 (𝜑𝐵 ω)
452, 10, 12, 36, 43, 44tfrcl 6573 . . 3 (𝜑 → (𝐺𝐵) ∈ 𝑆)
468, 45eqeltrd 2308 . 2 (𝜑 → ((𝐺 ↾ ω)‘𝐵) ∈ 𝑆)
475, 46eqeltrid 2318 1 (𝜑 → (frec(𝐹, 𝐴)‘𝐵) ∈ 𝑆)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 716  w3a 1005   = wceq 1398  wcel 2202  {cab 2217  wral 2511  wrex 2512  Vcvv 2803  c0 3496   cuni 3898  cmpt 4155  Ord word 4465  Lim wlim 4467  suc csuc 4468  ωcom 4694  dom cdm 4731  cres 4733  Fun wfun 5327  wf 5329  cfv 5333  recscrecs 6513  freccfrec 6599
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-recs 6514  df-frec 6600
This theorem is referenced by:  freccl  6612
  Copyright terms: Public domain W3C validator