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

Theorem tfrlemibacc 5971
Description: Each element of 𝐵 is an acceptable function. Lemma for tfrlemi1 5977. (Contributed by Jim Kingdon, 14-Mar-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
tfrlemibacc (𝜑𝐵𝐴)
Distinct variable groups:   𝑓,𝑔,,𝑤,𝑥,𝑦,𝑧,𝐴   𝑓,𝐹,𝑔,,𝑤,𝑥,𝑦,𝑧   𝜑,𝑤,𝑦   𝑤,𝐵,𝑓,𝑔,,𝑧   𝜑,𝑔,,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑓)   𝐵(𝑥,𝑦)

Proof of Theorem tfrlemibacc
StepHypRef Expression
1 tfrlemi1.3 . 2 𝐵 = { ∣ ∃𝑧𝑥𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))}
2 simpr3 923 . . . . . . 7 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))
3 tfrlemisucfn.1 . . . . . . . 8 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
4 tfrlemisucfn.2 . . . . . . . . 9 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹𝑥) ∈ V))
54ad2antrr 465 . . . . . . . 8 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → ∀𝑥(Fun 𝐹 ∧ (𝐹𝑥) ∈ V))
6 tfrlemi1.4 . . . . . . . . . 10 (𝜑𝑥 ∈ On)
76ad2antrr 465 . . . . . . . . 9 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → 𝑥 ∈ On)
8 simplr 490 . . . . . . . . 9 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → 𝑧𝑥)
9 onelon 4149 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑧𝑥) → 𝑧 ∈ On)
107, 8, 9syl2anc 397 . . . . . . . 8 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → 𝑧 ∈ On)
11 simpr1 921 . . . . . . . 8 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → 𝑔 Fn 𝑧)
12 simpr2 922 . . . . . . . 8 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → 𝑔𝐴)
133, 5, 10, 11, 12tfrlemisucaccv 5970 . . . . . . 7 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴)
142, 13eqeltrd 2130 . . . . . 6 (((𝜑𝑧𝑥) ∧ (𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))) → 𝐴)
1514ex 112 . . . . 5 ((𝜑𝑧𝑥) → ((𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})) → 𝐴))
1615exlimdv 1716 . . . 4 ((𝜑𝑧𝑥) → (∃𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})) → 𝐴))
1716rexlimdva 2450 . . 3 (𝜑 → (∃𝑧𝑥𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})) → 𝐴))
1817abssdv 3042 . 2 (𝜑 → { ∣ ∃𝑧𝑥𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}))} ⊆ 𝐴)
191, 18syl5eqss 3017 1 (𝜑𝐵𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  w3a 896  wal 1257   = wceq 1259  wex 1397  wcel 1409  {cab 2042  wral 2323  wrex 2324  Vcvv 2574  cun 2943  wss 2945  {csn 3403  cop 3406  Oncon0 4128  cres 4375  Fun wfun 4924   Fn wfn 4925  cfv 4930
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-pow 3955  ax-pr 3972  ax-un 4198  ax-setind 4290
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-v 2576  df-sbc 2788  df-dif 2948  df-un 2950  df-in 2952  df-ss 2959  df-nul 3253  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-br 3793  df-opab 3847  df-tr 3883  df-id 4058  df-iord 4131  df-on 4133  df-suc 4136  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-res 4385  df-iota 4895  df-fun 4932  df-fn 4933  df-fv 4938
This theorem is referenced by:  tfrlemibfn  5973  tfrlemiubacc  5975
  Copyright terms: Public domain W3C validator