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

Theorem tfr1onlemssrecs 6548
Description: Lemma for tfr1on 6559. The union of functions acceptable for tfr1on 6559 is a subset of recs. (Contributed by Jim Kingdon, 15-Mar-2022.)
Hypotheses
Ref Expression
tfr1onlemssrecs.1 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
tfr1onlemssrecs.x (𝜑 → Ord 𝑋)
Assertion
Ref Expression
tfr1onlemssrecs (𝜑 𝐴 ⊆ recs(𝐺))
Distinct variable groups:   𝑓,𝐺,𝑥,𝑦   𝑥,𝑋   𝜑,𝑓
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥,𝑦,𝑓)   𝑋(𝑦,𝑓)

Proof of Theorem tfr1onlemssrecs
StepHypRef Expression
1 tfr1onlemssrecs.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
2 tfr1onlemssrecs.x . . . . . 6 (𝜑 → Ord 𝑋)
3 ordsson 4596 . . . . . 6 (Ord 𝑋𝑋 ⊆ On)
4 ssrexv 3293 . . . . . 6 (𝑋 ⊆ On → (∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))))
52, 3, 43syl 17 . . . . 5 (𝜑 → (∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))))
65ss2abdv 3301 . . . 4 (𝜑 → {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))} ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))})
71, 6eqsstrid 3274 . . 3 (𝜑𝐴 ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))})
87unissd 3922 . 2 (𝜑 𝐴 {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))})
9 df-recs 6514 . 2 recs(𝐺) = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
108, 9sseqtrrdi 3277 1 (𝜑 𝐴 ⊆ recs(𝐺))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  {cab 2217  wral 2511  wrex 2512  wss 3201   cuni 3898  Ord word 4465  Oncon0 4466  cres 4733   Fn wfn 5328  cfv 5333  recscrecs 6513
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-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-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-in 3207  df-ss 3214  df-uni 3899  df-tr 4193  df-iord 4469  df-on 4471  df-recs 6514
This theorem is referenced by:  tfr1onlembfn  6553  tfr1onlemubacc  6555  tfr1onlemres  6558
  Copyright terms: Public domain W3C validator