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

Theorem tfrlemisucaccv 6596
Description: We can extend an acceptable function by one element to produce an acceptable function. Lemma for tfrlemi1 6603. (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 onsuc 4648 . . . 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 6595 . . 3 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧)
9 vex 2824 . . . . . 6 𝑢 ∈ V
109elsuc 4551 . . . . 5 (𝑢 ∈ suc 𝑧 ↔ (𝑢𝑧𝑢 = 𝑧))
11 vex 2824 . . . . . . . . . . 11 𝑔 ∈ V
124, 11tfrlem3a 6581 . . . . . . . . . 10 (𝑔𝐴 ↔ ∃𝑣 ∈ On (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))
137, 12sylib 122 . . . . . . . . 9 (𝜑 → ∃𝑣 ∈ On (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))
14 simprrr 546 . . . . . . . . . 10 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
15 simprrl 545 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → 𝑔 Fn 𝑣)
166adantr 276 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → 𝑔 Fn 𝑧)
17 fndmu 5484 . . . . . . . . . . . 12 ((𝑔 Fn 𝑣𝑔 Fn 𝑧) → 𝑣 = 𝑧)
1815, 16, 17syl2anc 415 . . . . . . . . . . 11 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → 𝑣 = 𝑧)
1918raleqdv 2755 . . . . . . . . . 10 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → (∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢)) ↔ ∀𝑢𝑧 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))
2014, 19mpbid 147 . . . . . . . . 9 ((𝜑 ∧ (𝑣 ∈ On ∧ (𝑔 Fn 𝑣 ∧ ∀𝑢𝑣 (𝑔𝑢) = (𝐹‘(𝑔𝑢))))) → ∀𝑢𝑧 (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
2113, 20rexlimddv 2673 . . . . . . . 8 (𝜑 → ∀𝑢𝑧 (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
2221r19.21bi 2638 . . . . . . 7 ((𝜑𝑢𝑧) → (𝑔𝑢) = (𝐹‘(𝑔𝑢)))
23 elirrv 4695 . . . . . . . . . . 11 ¬ 𝑢𝑢
24 elequ2 2214 . . . . . . . . . . 11 (𝑧 = 𝑢 → (𝑢𝑧𝑢𝑢))
2523, 24mtbiri 686 . . . . . . . . . 10 (𝑧 = 𝑢 → ¬ 𝑢𝑧)
2625necon2ai 2474 . . . . . . . . 9 (𝑢𝑧𝑧𝑢)
2726adantl 277 . . . . . . . 8 ((𝜑𝑢𝑧) → 𝑧𝑢)
28 fvunsng 5909 . . . . . . . 8 ((𝑢 ∈ V ∧ 𝑧𝑢) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝑔𝑢))
299, 27, 28sylancr 418 . . . . . . 7 ((𝜑𝑢𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝑔𝑢))
30 eloni 4520 . . . . . . . . . . . 12 (𝑧 ∈ On → Ord 𝑧)
311, 30syl 14 . . . . . . . . . . 11 (𝜑 → Ord 𝑧)
32 ordelss 4524 . . . . . . . . . . 11 ((Ord 𝑧𝑢𝑧) → 𝑢𝑧)
3331, 32sylan 283 . . . . . . . . . 10 ((𝜑𝑢𝑧) → 𝑢𝑧)
34 resabs1 5092 . . . . . . . . . 10 (𝑢𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))
3533, 34syl 14 . . . . . . . . 9 ((𝜑𝑢𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))
36 elirrv 4695 . . . . . . . . . . . 12 ¬ 𝑧𝑧
37 fsnunres 5917 . . . . . . . . . . . 12 ((𝑔 Fn 𝑧 ∧ ¬ 𝑧𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) = 𝑔)
386, 36, 37sylancl 417 . . . . . . . . . . 11 (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) = 𝑔)
3938reseq1d 5062 . . . . . . . . . 10 (𝜑 → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔𝑢))
4039adantr 276 . . . . . . . . 9 ((𝜑𝑢𝑧) → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧) ↾ 𝑢) = (𝑔𝑢))
4135, 40eqtr3d 2273 . . . . . . . 8 ((𝜑𝑢𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢) = (𝑔𝑢))
4241fveq2d 5699 . . . . . . 7 ((𝜑𝑢𝑧) → (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)) = (𝐹‘(𝑔𝑢)))
4322, 29, 423eqtr4d 2281 . . . . . 6 ((𝜑𝑢𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
445tfrlem3-2d 6583 . . . . . . . . . 10 (𝜑 → (Fun 𝐹 ∧ (𝐹𝑔) ∈ V))
4544simprd 114 . . . . . . . . 9 (𝜑 → (𝐹𝑔) ∈ V)
46 fndm 5480 . . . . . . . . . . . 12 (𝑔 Fn 𝑧 → dom 𝑔 = 𝑧)
476, 46syl 14 . . . . . . . . . . 11 (𝜑 → dom 𝑔 = 𝑧)
4847eleq2d 2308 . . . . . . . . . 10 (𝜑 → (𝑧 ∈ dom 𝑔𝑧𝑧))
4936, 48mtbiri 686 . . . . . . . . 9 (𝜑 → ¬ 𝑧 ∈ dom 𝑔)
50 fsnunfv 5916 . . . . . . . . 9 ((𝑧 ∈ On ∧ (𝐹𝑔) ∈ V ∧ ¬ 𝑧 ∈ dom 𝑔) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧) = (𝐹𝑔))
511, 45, 49, 50syl3anc 1278 . . . . . . . 8 (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧) = (𝐹𝑔))
5251adantr 276 . . . . . . 7 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧) = (𝐹𝑔))
53 simpr 110 . . . . . . . 8 ((𝜑𝑢 = 𝑧) → 𝑢 = 𝑧)
5453fveq2d 5699 . . . . . . 7 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑧))
55 reseq2 5058 . . . . . . . . 9 (𝑢 = 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢) = ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑧))
5655, 38sylan9eqr 2293 . . . . . . . 8 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢) = 𝑔)
5756fveq2d 5699 . . . . . . 7 ((𝜑𝑢 = 𝑧) → (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)) = (𝐹𝑔))
5852, 54, 573eqtr4d 2281 . . . . . 6 ((𝜑𝑢 = 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
5943, 58jaodan 809 . . . . 5 ((𝜑 ∧ (𝑢𝑧𝑢 = 𝑧)) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
6010, 59sylan2b 287 . . . 4 ((𝜑𝑢 ∈ suc 𝑧) → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
6160ralrimiva 2623 . . 3 (𝜑 → ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))
62 fneq2 5470 . . . . 5 (𝑤 = suc 𝑧 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ↔ (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧))
63 raleq 2749 . . . . 5 (𝑤 = suc 𝑧 → (∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)) ↔ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))))
6462, 63anbi12d 477 . . . 4 (𝑤 = suc 𝑧 → (((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))) ↔ ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))))
6564rspcev 2929 . . 3 ((suc 𝑧 ∈ On ∧ ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn suc 𝑧 ∧ ∀𝑢 ∈ suc 𝑧((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))) → ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))))
663, 8, 61, 65syl12anc 1276 . 2 (𝜑 → ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢))))
67 vex 2824 . . . . . 6 𝑧 ∈ V
68 opexg 4368 . . . . . 6 ((𝑧 ∈ V ∧ (𝐹𝑔) ∈ V) → ⟨𝑧, (𝐹𝑔)⟩ ∈ V)
6967, 45, 68sylancr 418 . . . . 5 (𝜑 → ⟨𝑧, (𝐹𝑔)⟩ ∈ V)
70 snexg 4321 . . . . 5 (⟨𝑧, (𝐹𝑔)⟩ ∈ V → {⟨𝑧, (𝐹𝑔)⟩} ∈ V)
7169, 70syl 14 . . . 4 (𝜑 → {⟨𝑧, (𝐹𝑔)⟩} ∈ V)
72 unexg 4589 . . . 4 ((𝑔 ∈ V ∧ {⟨𝑧, (𝐹𝑔)⟩} ∈ V) → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ V)
7311, 71, 72sylancr 418 . . 3 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ V)
744tfrlem3ag 6580 . . 3 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ V → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))))
7573, 74syl 14 . 2 (𝜑 → ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴 ↔ ∃𝑤 ∈ On ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) Fn 𝑤 ∧ ∀𝑢𝑤 ((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩})‘𝑢) = (𝐹‘((𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ↾ 𝑢)))))
7666, 75mpbird 167 1 (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐹𝑔)⟩}) ∈ 𝐴)
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 104  wb 105  wo 720  wal 1400   = wceq 1402  wcel 2209  {cab 2224  wne 2420  wral 2528  wrex 2529  Vcvv 2821  cun 3218  wss 3220  {csn 3709  cop 3712  Ord word 4507  Oncon0 4508  suc csuc 4510  dom cdm 4774  cres 4776  Fun wfun 5371   Fn wfn 5372  cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385
This theorem is used by:  tfrlemibacc  6597  tfrlemi14d  6604
  Copyright terms: Public domain W3C validator