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

Theorem tfrlemisucaccv 6262
Description: We can extend an acceptable function by one element to produce an acceptable function. Lemma for tfrlemi1 6269. (Contributed by Jim Kingdon, 4-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)
Hypotheses
Ref Expression
tfrlemisucfn.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
tfrlemisucfn.2 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹𝑥) ∈ V))
tfrlemisucfn.3 (𝜑𝑧 ∈ On)
tfrlemisucfn.4 (𝜑𝑔 Fn 𝑧)
tfrlemisucfn.5 (𝜑𝑔𝐴)
Assertion
Ref Expression
tfrlemisucaccv (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴)
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝑧,𝐴   𝑓,𝐹,𝑔,𝑥,𝑦,𝑧   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑧,𝑓,𝑔)

Proof of Theorem tfrlemisucaccv
Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrlemisucfn.3 . . . 4 (𝜑𝑧 ∈ On)
2 suceloni 4454 . . . 4 (𝑧 ∈ On → suc 𝑧 ∈ On)
31, 2syl 14 . . 3 (𝜑 → suc 𝑧 ∈ On)
4 tfrlemisucfn.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
5 tfrlemisucfn.2 . . . 4 (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹𝑥) ∈ V))
6 tfrlemisucfn.4 . . . 4 (𝜑𝑔 Fn 𝑧)
7 tfrlemisucfn.5 . . . 4 (𝜑𝑔𝐴)
84, 5, 1, 6, 7tfrlemisucfn 6261 . . 3 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧)
9 vex 2712 . . . . . 6 𝑢 ∈ V
109elsuc 4361 . . . . 5 (𝑢 ∈ suc 𝑧 ↔ (𝑢𝑧𝑢 = 𝑧))
11 vex 2712 . . . . . . . . . . 11 𝑔 ∈ V
124, 11tfrlem3a 6247 . . . . . . . . . 10 (𝑔𝐴 ↔ ∃𝑣 ∈ On (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))
137, 12sylib 121 . . . . . . . . 9 (𝜑 → ∃𝑣 ∈ On (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))
14 simprrr 530 . . . . . . . . . 10 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
15 simprrl 529 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → 𝑔 Fn 𝑣)
166adantr 274 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → 𝑔 Fn 𝑧)
17 fndmu 5264 . . . . . . . . . . . 12 ((𝑔 Fn 𝑣𝑔 Fn 𝑧) → 𝑣 = 𝑧)
1815, 16, 17syl2anc 409 . . . . . . . . . . 11 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → 𝑣 = 𝑧)
1918raleqdv 2655 . . . . . . . . . 10 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → (∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢)) ↔ ∀𝑢𝑧 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))
2014, 19mpbid 146 . . . . . . . . 9 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → ∀𝑢𝑧 (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
2113, 20rexlimddv 2576 . . . . . . . 8 (𝜑 → ∀𝑢𝑧 (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
2221r19.21bi 2542 . . . . . . 7 ((𝜑𝑢𝑧) → (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
23 elirrv 4501 . . . . . . . . . . 11 ¬ 𝑢𝑢
24 elequ2 2130 . . . . . . . . . . 11 (𝑧 = 𝑢 → (𝑢𝑧𝑢𝑢))
2523, 24mtbiri 665 . . . . . . . . . 10 (𝑧 = 𝑢 → ¬ 𝑢𝑧)
2625necon2ai 2378 . . . . . . . . 9 (𝑢𝑧𝑧𝑢)
2726adantl 275 . . . . . . . 8 ((𝜑𝑢𝑧) → 𝑧𝑢)
28 fvunsng 5654 . . . . . . . 8 ((𝑢 ∈ V ∧ 𝑧𝑢) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝑔𝑢))
299, 27, 28sylancr 411 . . . . . . 7 ((𝜑𝑢𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝑔𝑢))
30 eloni 4330 . . . . . . . . . . . 12 (𝑧 ∈ On → Ord 𝑧)
311, 30syl 14 . . . . . . . . . . 11 (𝜑 → Ord 𝑧)
32 ordelss 4334 . . . . . . . . . . 11 ((Ord 𝑧𝑢𝑧) → 𝑢𝑧)
3331, 32sylan 281 . . . . . . . . . 10 ((𝜑𝑢𝑧) → 𝑢𝑧)
34 resabs1 4888 . . . . . . . . . 10 (𝑢𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))
3533, 34syl 14 . . . . . . . . 9 ((𝜑𝑢𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))
36 elirrv 4501 . . . . . . . . . . . 12 ¬ 𝑧𝑧
37 fsnunres 5662 . . . . . . . . . . . 12 ((𝑔 Fn 𝑧 ∧ ¬ 𝑧𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) = 𝑔)
386, 36, 37sylancl 410 . . . . . . . . . . 11 (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) = 𝑔)
3938reseq1d 4858 . . . . . . . . . 10 (𝜑 → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔𝑢))
4039adantr 274 . . . . . . . . 9 ((𝜑𝑢𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔𝑢))
4135, 40eqtr3d 2189 . . . . . . . 8 ((𝜑𝑢𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢) = (𝑔𝑢))
4241fveq2d 5465 . . . . . . 7 ((𝜑𝑢𝑧) → (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)) = (𝐹‘(𝑔𝑢)))
4322, 29, 423eqtr4d 2197 . . . . . 6 ((𝜑𝑢𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
445tfrlem3-2d 6249 . . . . . . . . . 10 (𝜑 → (Fun 𝐹 ∧ (𝐹𝑔) ∈ V))
4544simprd 113 . . . . . . . . 9 (𝜑 → (𝐹𝑔) ∈ V)
46 fndm 5262 . . . . . . . . . . . 12 (𝑔 Fn 𝑧 → dom 𝑔 = 𝑧)
476, 46syl 14 . . . . . . . . . . 11 (𝜑 → dom 𝑔 = 𝑧)
4847eleq2d 2224 . . . . . . . . . 10 (𝜑 → (𝑧 ∈ dom 𝑔𝑧𝑧))
4936, 48mtbiri 665 . . . . . . . . 9 (𝜑 → ¬ 𝑧 ∈ dom 𝑔)
50 fsnunfv 5661 . . . . . . . . 9 ((𝑧 ∈ On ∧ (𝐹𝑔) ∈ V ∧ ¬ 𝑧 ∈ dom 𝑔) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧) = (𝐹𝑔))
511, 45, 49, 50syl3anc 1217 . . . . . . . 8 (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧) = (𝐹𝑔))
5251adantr 274 . . . . . . 7 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧) = (𝐹𝑔))
53 simpr 109 . . . . . . . 8 ((𝜑𝑢 = 𝑧) → 𝑢 = 𝑧)
5453fveq2d 5465 . . . . . . 7 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧))
55 reseq2 4854 . . . . . . . . 9 (𝑢 = 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧))
5655, 38sylan9eqr 2209 . . . . . . . 8 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢) = 𝑔)
5756fveq2d 5465 . . . . . . 7 ((𝜑𝑢 = 𝑧) → (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)) = (𝐹𝑔))
5852, 54, 573eqtr4d 2197 . . . . . 6 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
5943, 58jaodan 787 . . . . 5 ((𝜑 ∧ (𝑢𝑧𝑢 = 𝑧)) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
6010, 59sylan2b 285 . . . 4 ((𝜑𝑢 ∈ suc 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
6160ralrimiva 2527 . . 3 (𝜑 → ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
62 fneq2 5252 . . . . 5 (𝑤 = suc 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ↔ (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧))
63 raleq 2649 . . . . 5 (𝑤 = suc 𝑧 → (∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)) ↔ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))))
6462, 63anbi12d 465 . . . 4 (𝑤 = suc 𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))) ↔ ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))))
6564rspcev 2813 . . 3 ((suc 𝑧 ∈ On ∧ ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))) → ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))))
663, 8, 61, 65syl12anc 1215 . 2 (𝜑 → ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))))
67 vex 2712 . . . . . 6 𝑧 ∈ V
68 opexg 4183 . . . . . 6 ((𝑧 ∈ V ∧ (𝐹𝑔) ∈ V) → ⟨𝑧, (𝐹𝑔)⟩ ∈ V)
6967, 45, 68sylancr 411 . . . . 5 (𝜑 → ⟨𝑧, (𝐹𝑔)⟩ ∈ V)
70 snexg 4140 . . . . 5 (⟨𝑧, (𝐹𝑔)⟩ ∈ V → {⟨𝑧, (𝐹𝑔)⟩} ∈ V)
7169, 70syl 14 . . . 4 (𝜑 → {⟨𝑧, (𝐹𝑔)⟩} ∈ V)
72 unexg 4397 . . . 4 ((𝑔 ∈ V ∧ {⟨𝑧, (𝐹𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ V)
7311, 71, 72sylancr 411 . . 3 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ V)
744tfrlem3ag 6246 . . 3 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ V → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))))
7573, 74syl 14 . 2 (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))))
7666, 75mpbird 166 1 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 698  wal 1330   = wceq 1332  wcel 2125  {cab 2140  wne 2324  wral 2432  wrex 2433  Vcvv 2709  cun 3096  wss 3098  {csn 3556  cop 3559  Ord word 4317  Oncon0 4318  suc csuc 4320  dom cdm 4579  cres 4581  Fun wfun 5157   Fn wfn 5158  cfv 5163
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-sep 4078  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-ral 2437  df-rex 2438  df-v 2711  df-sbc 2934  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-nul 3391  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-br 3962  df-opab 4022  df-tr 4059  df-id 4248  df-iord 4321  df-on 4323  df-suc 4326  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588  df-dm 4589  df-res 4591  df-iota 5128  df-fun 5165  df-fn 5166  df-fv 5171
This theorem is referenced by:  tfrlemibacc  6263  tfrlemi14d  6270
  Copyright terms: Public domain W3C validator