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

Theorem frecuzrdgrclt 9549
 Description: The function 𝑅 (used in the definition of the recursive definition generator on upper integers) yields ordered pairs of integers and elements of 𝑆. Similar to frecuzrdgrcl 9544 except that 𝑆 and 𝑇 need not be the same. (Contributed by Jim Kingdon, 22-Apr-2022.)
Hypotheses
Ref Expression
frecuzrdgrclt.c (𝜑𝐶 ∈ ℤ)
frecuzrdgrclt.a (𝜑𝐴𝑆)
frecuzrdgrclt.t (𝜑𝑆𝑇)
frecuzrdgrclt.f ((𝜑 ∧ (𝑥 ∈ (ℤ𝐶) ∧ 𝑦𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
frecuzrdgrclt.r 𝑅 = frec((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
Assertion
Ref Expression
frecuzrdgrclt (𝜑𝑅:ω⟶((ℤ𝐶) × 𝑆))
Distinct variable groups:   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝑅(𝑥,𝑦)

Proof of Theorem frecuzrdgrclt
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 1st2nd2 5852 . . . . . . 7 (𝑧 ∈ ((ℤ𝐶) × 𝑆) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
21adantl 271 . . . . . 6 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
32fveq2d 5233 . . . . 5 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) = ((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st𝑧), (2nd𝑧)⟩))
4 df-ov 5566 . . . . . . 7 ((1st𝑧)(𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd𝑧)) = ((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st𝑧), (2nd𝑧)⟩)
5 xp1st 5843 . . . . . . . . 9 (𝑧 ∈ ((ℤ𝐶) × 𝑆) → (1st𝑧) ∈ (ℤ𝐶))
65adantl 271 . . . . . . . 8 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → (1st𝑧) ∈ (ℤ𝐶))
7 frecuzrdgrclt.t . . . . . . . . . 10 (𝜑𝑆𝑇)
87sseld 3007 . . . . . . . . 9 (𝜑 → ((2nd𝑧) ∈ 𝑆 → (2nd𝑧) ∈ 𝑇))
9 xp2nd 5844 . . . . . . . . 9 (𝑧 ∈ ((ℤ𝐶) × 𝑆) → (2nd𝑧) ∈ 𝑆)
108, 9impel 274 . . . . . . . 8 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → (2nd𝑧) ∈ 𝑇)
11 peano2uz 8804 . . . . . . . . . 10 ((1st𝑧) ∈ (ℤ𝐶) → ((1st𝑧) + 1) ∈ (ℤ𝐶))
126, 11syl 14 . . . . . . . . 9 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((1st𝑧) + 1) ∈ (ℤ𝐶))
13 frecuzrdgrclt.f . . . . . . . . . . . 12 ((𝜑 ∧ (𝑥 ∈ (ℤ𝐶) ∧ 𝑦𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
1413ralrimivva 2448 . . . . . . . . . . 11 (𝜑 → ∀𝑥 ∈ (ℤ𝐶)∀𝑦𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
1514adantr 270 . . . . . . . . . 10 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ∀𝑥 ∈ (ℤ𝐶)∀𝑦𝑆 (𝑥𝐹𝑦) ∈ 𝑆)
169adantl 271 . . . . . . . . . . 11 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → (2nd𝑧) ∈ 𝑆)
17 oveq1 5570 . . . . . . . . . . . . 13 (𝑥 = (1st𝑧) → (𝑥𝐹𝑦) = ((1st𝑧)𝐹𝑦))
1817eleq1d 2151 . . . . . . . . . . . 12 (𝑥 = (1st𝑧) → ((𝑥𝐹𝑦) ∈ 𝑆 ↔ ((1st𝑧)𝐹𝑦) ∈ 𝑆))
19 oveq2 5571 . . . . . . . . . . . . 13 (𝑦 = (2nd𝑧) → ((1st𝑧)𝐹𝑦) = ((1st𝑧)𝐹(2nd𝑧)))
2019eleq1d 2151 . . . . . . . . . . . 12 (𝑦 = (2nd𝑧) → (((1st𝑧)𝐹𝑦) ∈ 𝑆 ↔ ((1st𝑧)𝐹(2nd𝑧)) ∈ 𝑆))
2118, 20rspc2v 2721 . . . . . . . . . . 11 (((1st𝑧) ∈ (ℤ𝐶) ∧ (2nd𝑧) ∈ 𝑆) → (∀𝑥 ∈ (ℤ𝐶)∀𝑦𝑆 (𝑥𝐹𝑦) ∈ 𝑆 → ((1st𝑧)𝐹(2nd𝑧)) ∈ 𝑆))
226, 16, 21syl2anc 403 . . . . . . . . . 10 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → (∀𝑥 ∈ (ℤ𝐶)∀𝑦𝑆 (𝑥𝐹𝑦) ∈ 𝑆 → ((1st𝑧)𝐹(2nd𝑧)) ∈ 𝑆))
2315, 22mpd 13 . . . . . . . . 9 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((1st𝑧)𝐹(2nd𝑧)) ∈ 𝑆)
24 opelxp 4420 . . . . . . . . 9 (⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩ ∈ ((ℤ𝐶) × 𝑆) ↔ (((1st𝑧) + 1) ∈ (ℤ𝐶) ∧ ((1st𝑧)𝐹(2nd𝑧)) ∈ 𝑆))
2512, 23, 24sylanbrc 408 . . . . . . . 8 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩ ∈ ((ℤ𝐶) × 𝑆))
26 oveq1 5570 . . . . . . . . . 10 (𝑥 = (1st𝑧) → (𝑥 + 1) = ((1st𝑧) + 1))
2726, 17opeq12d 3598 . . . . . . . . 9 (𝑥 = (1st𝑧) → ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩ = ⟨((1st𝑧) + 1), ((1st𝑧)𝐹𝑦)⟩)
2819opeq2d 3597 . . . . . . . . 9 (𝑦 = (2nd𝑧) → ⟨((1st𝑧) + 1), ((1st𝑧)𝐹𝑦)⟩ = ⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩)
29 eqid 2083 . . . . . . . . 9 (𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩) = (𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)
3027, 28, 29ovmpt2g 5686 . . . . . . . 8 (((1st𝑧) ∈ (ℤ𝐶) ∧ (2nd𝑧) ∈ 𝑇 ∧ ⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩ ∈ ((ℤ𝐶) × 𝑆)) → ((1st𝑧)(𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd𝑧)) = ⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩)
316, 10, 25, 30syl3anc 1170 . . . . . . 7 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((1st𝑧)(𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)(2nd𝑧)) = ⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩)
324, 31syl5eqr 2129 . . . . . 6 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st𝑧), (2nd𝑧)⟩) = ⟨((1st𝑧) + 1), ((1st𝑧)𝐹(2nd𝑧))⟩)
3332, 25eqeltrd 2159 . . . . 5 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘⟨(1st𝑧), (2nd𝑧)⟩) ∈ ((ℤ𝐶) × 𝑆))
343, 33eqeltrd 2159 . . . 4 ((𝜑𝑧 ∈ ((ℤ𝐶) × 𝑆)) → ((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ𝐶) × 𝑆))
3534ralrimiva 2439 . . 3 (𝜑 → ∀𝑧 ∈ ((ℤ𝐶) × 𝑆)((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ𝐶) × 𝑆))
36 frecuzrdgrclt.c . . . . 5 (𝜑𝐶 ∈ ℤ)
37 uzid 8766 . . . . 5 (𝐶 ∈ ℤ → 𝐶 ∈ (ℤ𝐶))
3836, 37syl 14 . . . 4 (𝜑𝐶 ∈ (ℤ𝐶))
39 frecuzrdgrclt.a . . . 4 (𝜑𝐴𝑆)
40 opelxp 4420 . . . 4 (⟨𝐶, 𝐴⟩ ∈ ((ℤ𝐶) × 𝑆) ↔ (𝐶 ∈ (ℤ𝐶) ∧ 𝐴𝑆))
4138, 39, 40sylanbrc 408 . . 3 (𝜑 → ⟨𝐶, 𝐴⟩ ∈ ((ℤ𝐶) × 𝑆))
42 frecfcl 6074 . . 3 ((∀𝑧 ∈ ((ℤ𝐶) × 𝑆)((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩)‘𝑧) ∈ ((ℤ𝐶) × 𝑆) ∧ ⟨𝐶, 𝐴⟩ ∈ ((ℤ𝐶) × 𝑆)) → frec((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩):ω⟶((ℤ𝐶) × 𝑆))
4335, 41, 42syl2anc 403 . 2 (𝜑 → frec((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩):ω⟶((ℤ𝐶) × 𝑆))
44 frecuzrdgrclt.r . . 3 𝑅 = frec((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩)
4544feq1i 5090 . 2 (𝑅:ω⟶((ℤ𝐶) × 𝑆) ↔ frec((𝑥 ∈ (ℤ𝐶), 𝑦𝑇 ↦ ⟨(𝑥 + 1), (𝑥𝐹𝑦)⟩), ⟨𝐶, 𝐴⟩):ω⟶((ℤ𝐶) × 𝑆))
4643, 45sylibr 132 1 (𝜑𝑅:ω⟶((ℤ𝐶) × 𝑆))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 102   = wceq 1285   ∈ wcel 1434  ∀wral 2353   ⊆ wss 2982  ⟨cop 3419  ωcom 4359   × cxp 4389  ⟶wf 4948  ‘cfv 4952  (class class class)co 5563   ↦ cmpt2 5565  1st c1st 5816  2nd c2nd 5817  freccfrec 6059  1c1 7096   + caddc 7098  ℤcz 8484  ℤ≥cuz 8752 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3913  ax-sep 3916  ax-nul 3924  ax-pow 3968  ax-pr 3992  ax-un 4216  ax-setind 4308  ax-iinf 4357  ax-cnex 7181  ax-resscn 7182  ax-1cn 7183  ax-1re 7184  ax-icn 7185  ax-addcl 7186  ax-addrcl 7187  ax-mulcl 7188  ax-addcom 7190  ax-addass 7192  ax-distr 7194  ax-i2m1 7195  ax-0lt1 7196  ax-0id 7198  ax-rnegex 7199  ax-cnre 7201  ax-pre-ltirr 7202  ax-pre-ltwlin 7203  ax-pre-lttrn 7204  ax-pre-ltadd 7206 This theorem depends on definitions:  df-bi 115  df-3or 921  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-nel 2345  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2612  df-sbc 2825  df-csb 2918  df-dif 2984  df-un 2986  df-in 2988  df-ss 2995  df-nul 3268  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-uni 3622  df-int 3657  df-iun 3700  df-br 3806  df-opab 3860  df-mpt 3861  df-tr 3896  df-id 4076  df-iord 4149  df-on 4151  df-ilim 4152  df-suc 4154  df-iom 4360  df-xp 4397  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-rn 4402  df-res 4403  df-ima 4404  df-iota 4917  df-fun 4954  df-fn 4955  df-f 4956  df-f1 4957  df-fo 4958  df-f1o 4959  df-fv 4960  df-riota 5519  df-ov 5566  df-oprab 5567  df-mpt2 5568  df-1st 5818  df-2nd 5819  df-recs 5974  df-frec 6060  df-pnf 7269  df-mnf 7270  df-xr 7271  df-ltxr 7272  df-le 7273  df-sub 7400  df-neg 7401  df-inn 8159  df-n0 8408  df-z 8485  df-uz 8753 This theorem is referenced by:  frecuzrdgg  9550  frecuzrdgdomlem  9551  frecuzrdgfunlem  9553  frecuzrdgtclt  9555  frecuzrdg0t  9556  frecuzrdgsuctlem  9557  iseqvalt  9584
 Copyright terms: Public domain W3C validator