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

Theorem tfr1onlemssrecs 6397
Description: Lemma for tfr1on 6408. The union of functions acceptable for tfr1on 6408 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 4528 . . . . . 6 (Ord 𝑋𝑋 ⊆ On)
4 ssrexv 3248 . . . . . 6 (𝑋 ⊆ On → (∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))))
52, 3, 43syl 17 . . . . 5 (𝜑 → (∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))))
65ss2abdv 3256 . . . 4 (𝜑 → {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))} ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))})
71, 6eqsstrid 3229 . . 3 (𝜑𝐴 ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))})
87unissd 3863 . 2 (𝜑 𝐴 {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))})
9 df-recs 6363 . 2 recs(𝐺) = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
108, 9sseqtrrdi 3232 1 (𝜑 𝐴 ⊆ recs(𝐺))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  {cab 2182  wral 2475  wrex 2476  wss 3157   cuni 3839  Ord word 4397  Oncon0 4398  cres 4665   Fn wfn 5253  cfv 5258  recscrecs 6362
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-in 3163  df-ss 3170  df-uni 3840  df-tr 4132  df-iord 4401  df-on 4403  df-recs 6363
This theorem is referenced by:  tfr1onlembfn  6402  tfr1onlemubacc  6404  tfr1onlemres  6407
  Copyright terms: Public domain W3C validator