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

Theorem tfrlemiubacc 5999
Description: The union of 𝐵 satisfies the recursion rule (lemma for tfrlemi1 6001). (Contributed by Jim Kingdon, 22-Apr-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)
Hypotheses
Ref Expression
tfrlemisucfn.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
tfrlemisucfn.2 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹𝑥) ∈ V))
tfrlemi1.3 𝐵 = { ∣ ∃𝑧𝑥𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))}
tfrlemi1.4 (𝜑𝑥 ∈ On)
tfrlemi1.5 (𝜑 → ∀𝑧𝑥𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐹‘(𝑔𝑤))))
Assertion
Ref Expression
tfrlemiubacc (𝜑 → ∀𝑢𝑥 ( 𝐵𝑢) = (𝐹‘( 𝐵𝑢)))
Distinct variable groups:   𝑓,𝑔,,𝑢,𝑤,𝑥,𝑦,𝑧,𝐴   𝑓,𝐹,𝑔,,𝑢,𝑤,𝑥,𝑦,𝑧   𝜑,𝑤,𝑦   𝑢,𝐵,𝑤,𝑓,𝑔,,𝑧   𝜑,𝑔,,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑢,𝑓)   𝐵(𝑥,𝑦)

Proof of Theorem tfrlemiubacc
StepHypRef Expression
1 tfrlemisucfn.1 . . . . . . . . 9 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
2 tfrlemisucfn.2 . . . . . . . . 9 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹𝑥) ∈ V))
3 tfrlemi1.3 . . . . . . . . 9 𝐵 = { ∣ ∃𝑧𝑥𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))}
4 tfrlemi1.4 . . . . . . . . 9 (𝜑𝑥 ∈ On)
5 tfrlemi1.5 . . . . . . . . 9 (𝜑 → ∀𝑧𝑥𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐹‘(𝑔𝑤))))
61, 2, 3, 4, 5tfrlemibfn 5997 . . . . . . . 8 (𝜑 𝐵 Fn 𝑥)
7 fndm 5049 . . . . . . . 8 ( 𝐵 Fn 𝑥 → dom 𝐵 = 𝑥)
86, 7syl 14 . . . . . . 7 (𝜑 → dom 𝐵 = 𝑥)
91, 2, 3, 4, 5tfrlemibacc 5995 . . . . . . . . . 10 (𝜑𝐵𝐴)
109unissd 3645 . . . . . . . . 9 (𝜑 𝐵 𝐴)
111recsfval 5984 . . . . . . . . 9 recs(𝐹) = 𝐴
1210, 11syl6sseqr 3055 . . . . . . . 8 (𝜑 𝐵 ⊆ recs(𝐹))
13 dmss 4582 . . . . . . . 8 ( 𝐵 ⊆ recs(𝐹) → dom 𝐵 ⊆ dom recs(𝐹))
1412, 13syl 14 . . . . . . 7 (𝜑 → dom 𝐵 ⊆ dom recs(𝐹))
158, 14eqsstr3d 3043 . . . . . 6 (𝜑𝑥 ⊆ dom recs(𝐹))
1615sselda 3008 . . . . 5 ((𝜑𝑤𝑥) → 𝑤 ∈ dom recs(𝐹))
171tfrlem9 5988 . . . . 5 (𝑤 ∈ dom recs(𝐹) → (recs(𝐹)‘𝑤) = (𝐹‘(recs(𝐹) ↾ 𝑤)))
1816, 17syl 14 . . . 4 ((𝜑𝑤𝑥) → (recs(𝐹)‘𝑤) = (𝐹‘(recs(𝐹) ↾ 𝑤)))
191tfrlem7 5986 . . . . . 6 Fun recs(𝐹)
2019a1i 9 . . . . 5 ((𝜑𝑤𝑥) → Fun recs(𝐹))
2112adantr 270 . . . . 5 ((𝜑𝑤𝑥) → 𝐵 ⊆ recs(𝐹))
228eleq2d 2152 . . . . . 6 (𝜑 → (𝑤 ∈ dom 𝐵𝑤𝑥))
2322biimpar 291 . . . . 5 ((𝜑𝑤𝑥) → 𝑤 ∈ dom 𝐵)
24 funssfv 5251 . . . . 5 ((Fun recs(𝐹) ∧ 𝐵 ⊆ recs(𝐹) ∧ 𝑤 ∈ dom 𝐵) → (recs(𝐹)‘𝑤) = ( 𝐵𝑤))
2520, 21, 23, 24syl3anc 1170 . . . 4 ((𝜑𝑤𝑥) → (recs(𝐹)‘𝑤) = ( 𝐵𝑤))
26 eloni 4158 . . . . . . . . 9 (𝑥 ∈ On → Ord 𝑥)
274, 26syl 14 . . . . . . . 8 (𝜑 → Ord 𝑥)
28 ordelss 4162 . . . . . . . 8 ((Ord 𝑥𝑤𝑥) → 𝑤𝑥)
2927, 28sylan 277 . . . . . . 7 ((𝜑𝑤𝑥) → 𝑤𝑥)
308adantr 270 . . . . . . 7 ((𝜑𝑤𝑥) → dom 𝐵 = 𝑥)
3129, 30sseqtr4d 3045 . . . . . 6 ((𝜑𝑤𝑥) → 𝑤 ⊆ dom 𝐵)
32 fun2ssres 4993 . . . . . 6 ((Fun recs(𝐹) ∧ 𝐵 ⊆ recs(𝐹) ∧ 𝑤 ⊆ dom 𝐵) → (recs(𝐹) ↾ 𝑤) = ( 𝐵𝑤))
3320, 21, 31, 32syl3anc 1170 . . . . 5 ((𝜑𝑤𝑥) → (recs(𝐹) ↾ 𝑤) = ( 𝐵𝑤))
3433fveq2d 5233 . . . 4 ((𝜑𝑤𝑥) → (𝐹‘(recs(𝐹) ↾ 𝑤)) = (𝐹‘( 𝐵𝑤)))
3518, 25, 343eqtr3d 2123 . . 3 ((𝜑𝑤𝑥) → ( 𝐵𝑤) = (𝐹‘( 𝐵𝑤)))
3635ralrimiva 2439 . 2 (𝜑 → ∀𝑤𝑥 ( 𝐵𝑤) = (𝐹‘( 𝐵𝑤)))
37 fveq2 5229 . . . 4 (𝑢 = 𝑤 → ( 𝐵𝑢) = ( 𝐵𝑤))
38 reseq2 4655 . . . . 5 (𝑢 = 𝑤 → ( 𝐵𝑢) = ( 𝐵𝑤))
3938fveq2d 5233 . . . 4 (𝑢 = 𝑤 → (𝐹‘( 𝐵𝑢)) = (𝐹‘( 𝐵𝑤)))
4037, 39eqeq12d 2097 . . 3 (𝑢 = 𝑤 → (( 𝐵𝑢) = (𝐹‘( 𝐵𝑢)) ↔ ( 𝐵𝑤) = (𝐹‘( 𝐵𝑤))))
4140cbvralv 2582 . 2 (∀𝑢𝑥 ( 𝐵𝑢) = (𝐹‘( 𝐵𝑢)) ↔ ∀𝑤𝑥 ( 𝐵𝑤) = (𝐹‘( 𝐵𝑤)))
4236, 41sylibr 132 1 (𝜑 → ∀𝑢𝑥 ( 𝐵𝑢) = (𝐹‘( 𝐵𝑢)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  w3a 920  wal 1283   = wceq 1285  wex 1422  wcel 1434  {cab 2069  wral 2353  wrex 2354  Vcvv 2610  cun 2980  wss 2982  {csn 3416  cop 3419   cuni 3621  Ord word 4145  Oncon0 4146  dom cdm 4391  cres 4393  Fun wfun 4946   Fn wfn 4947  cfv 4952  recscrecs 5973
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-sep 3916  ax-pow 3968  ax-pr 3992  ax-un 4216  ax-setind 4308
This theorem depends on definitions:  df-bi 115  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-ral 2358  df-rex 2359  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-iun 3700  df-br 3806  df-opab 3860  df-mpt 3861  df-tr 3896  df-id 4076  df-iord 4149  df-on 4151  df-suc 4154  df-xp 4397  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-rn 4402  df-res 4403  df-iota 4917  df-fun 4954  df-fn 4955  df-f 4956  df-fv 4960  df-recs 5974
This theorem is referenced by:  tfrlemiex  6000
  Copyright terms: Public domain W3C validator