MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cantnfp1 Structured version   Visualization version   GIF version

Theorem cantnfp1 8742
Description: If 𝐹 is created by adding a single term (𝐹𝑋) = 𝑌 to 𝐺, where 𝑋 is larger than any element of the support of 𝐺, then 𝐹 is also a finitely supported function and it is assigned the value ((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 𝑧 where 𝑧 is the value of 𝐺. (Contributed by Mario Carneiro, 28-May-2015.) (Revised by AV, 1-Jul-2019.)
Hypotheses
Ref Expression
cantnfs.s 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a (𝜑𝐴 ∈ On)
cantnfs.b (𝜑𝐵 ∈ On)
cantnfp1.g (𝜑𝐺𝑆)
cantnfp1.x (𝜑𝑋𝐵)
cantnfp1.y (𝜑𝑌𝐴)
cantnfp1.s (𝜑 → (𝐺 supp ∅) ⊆ 𝑋)
cantnfp1.f 𝐹 = (𝑡𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺𝑡)))
Assertion
Ref Expression
cantnfp1 (𝜑 → (𝐹𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺))))
Distinct variable groups:   𝑡,𝐵   𝑡,𝐴   𝑡,𝑆   𝑡,𝐺   𝜑,𝑡   𝑡,𝑌   𝑡,𝑋
Allowed substitution hint:   𝐹(𝑡)

Proof of Theorem cantnfp1
Dummy variables 𝑘 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cantnfp1.f . . . . . 6 𝐹 = (𝑡𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺𝑡)))
2 cantnfs.b . . . . . . . . . . . . 13 (𝜑𝐵 ∈ On)
3 cantnfp1.x . . . . . . . . . . . . 13 (𝜑𝑋𝐵)
4 onelon 5891 . . . . . . . . . . . . 13 ((𝐵 ∈ On ∧ 𝑋𝐵) → 𝑋 ∈ On)
52, 3, 4syl2anc 573 . . . . . . . . . . . 12 (𝜑𝑋 ∈ On)
6 eloni 5876 . . . . . . . . . . . 12 (𝑋 ∈ On → Ord 𝑋)
7 ordirr 5884 . . . . . . . . . . . 12 (Ord 𝑋 → ¬ 𝑋𝑋)
85, 6, 73syl 18 . . . . . . . . . . 11 (𝜑 → ¬ 𝑋𝑋)
9 fvex 6342 . . . . . . . . . . . . . 14 (𝐺𝑋) ∈ V
10 dif1o 7734 . . . . . . . . . . . . . 14 ((𝐺𝑋) ∈ (V ∖ 1𝑜) ↔ ((𝐺𝑋) ∈ V ∧ (𝐺𝑋) ≠ ∅))
119, 10mpbiran 688 . . . . . . . . . . . . 13 ((𝐺𝑋) ∈ (V ∖ 1𝑜) ↔ (𝐺𝑋) ≠ ∅)
12 cantnfp1.g . . . . . . . . . . . . . . . . . . . 20 (𝜑𝐺𝑆)
13 cantnfs.s . . . . . . . . . . . . . . . . . . . . 21 𝑆 = dom (𝐴 CNF 𝐵)
14 cantnfs.a . . . . . . . . . . . . . . . . . . . . 21 (𝜑𝐴 ∈ On)
1513, 14, 2cantnfs 8727 . . . . . . . . . . . . . . . . . . . 20 (𝜑 → (𝐺𝑆 ↔ (𝐺:𝐵𝐴𝐺 finSupp ∅)))
1612, 15mpbid 222 . . . . . . . . . . . . . . . . . . 19 (𝜑 → (𝐺:𝐵𝐴𝐺 finSupp ∅))
1716simpld 482 . . . . . . . . . . . . . . . . . 18 (𝜑𝐺:𝐵𝐴)
18 ffn 6185 . . . . . . . . . . . . . . . . . 18 (𝐺:𝐵𝐴𝐺 Fn 𝐵)
1917, 18syl 17 . . . . . . . . . . . . . . . . 17 (𝜑𝐺 Fn 𝐵)
20 0ex 4924 . . . . . . . . . . . . . . . . . 18 ∅ ∈ V
2120a1i 11 . . . . . . . . . . . . . . . . 17 (𝜑 → ∅ ∈ V)
22 elsuppfn 7454 . . . . . . . . . . . . . . . . 17 ((𝐺 Fn 𝐵𝐵 ∈ On ∧ ∅ ∈ V) → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋𝐵 ∧ (𝐺𝑋) ≠ ∅)))
2319, 2, 21, 22syl3anc 1476 . . . . . . . . . . . . . . . 16 (𝜑 → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋𝐵 ∧ (𝐺𝑋) ≠ ∅)))
2411bicomi 214 . . . . . . . . . . . . . . . . . 18 ((𝐺𝑋) ≠ ∅ ↔ (𝐺𝑋) ∈ (V ∖ 1𝑜))
2524a1i 11 . . . . . . . . . . . . . . . . 17 (𝜑 → ((𝐺𝑋) ≠ ∅ ↔ (𝐺𝑋) ∈ (V ∖ 1𝑜)))
2625anbi2d 614 . . . . . . . . . . . . . . . 16 (𝜑 → ((𝑋𝐵 ∧ (𝐺𝑋) ≠ ∅) ↔ (𝑋𝐵 ∧ (𝐺𝑋) ∈ (V ∖ 1𝑜))))
2723, 26bitrd 268 . . . . . . . . . . . . . . 15 (𝜑 → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋𝐵 ∧ (𝐺𝑋) ∈ (V ∖ 1𝑜))))
28 cantnfp1.s . . . . . . . . . . . . . . . 16 (𝜑 → (𝐺 supp ∅) ⊆ 𝑋)
2928sseld 3751 . . . . . . . . . . . . . . 15 (𝜑 → (𝑋 ∈ (𝐺 supp ∅) → 𝑋𝑋))
3027, 29sylbird 250 . . . . . . . . . . . . . 14 (𝜑 → ((𝑋𝐵 ∧ (𝐺𝑋) ∈ (V ∖ 1𝑜)) → 𝑋𝑋))
313, 30mpand 675 . . . . . . . . . . . . 13 (𝜑 → ((𝐺𝑋) ∈ (V ∖ 1𝑜) → 𝑋𝑋))
3211, 31syl5bir 233 . . . . . . . . . . . 12 (𝜑 → ((𝐺𝑋) ≠ ∅ → 𝑋𝑋))
3332necon1bd 2961 . . . . . . . . . . 11 (𝜑 → (¬ 𝑋𝑋 → (𝐺𝑋) = ∅))
348, 33mpd 15 . . . . . . . . . 10 (𝜑 → (𝐺𝑋) = ∅)
3534ad3antrrr 709 . . . . . . . . 9 ((((𝜑𝑌 = ∅) ∧ 𝑡𝐵) ∧ 𝑡 = 𝑋) → (𝐺𝑋) = ∅)
36 simpr 471 . . . . . . . . . 10 ((((𝜑𝑌 = ∅) ∧ 𝑡𝐵) ∧ 𝑡 = 𝑋) → 𝑡 = 𝑋)
3736fveq2d 6336 . . . . . . . . 9 ((((𝜑𝑌 = ∅) ∧ 𝑡𝐵) ∧ 𝑡 = 𝑋) → (𝐺𝑡) = (𝐺𝑋))
38 simpllr 760 . . . . . . . . 9 ((((𝜑𝑌 = ∅) ∧ 𝑡𝐵) ∧ 𝑡 = 𝑋) → 𝑌 = ∅)
3935, 37, 383eqtr4rd 2816 . . . . . . . 8 ((((𝜑𝑌 = ∅) ∧ 𝑡𝐵) ∧ 𝑡 = 𝑋) → 𝑌 = (𝐺𝑡))
40 eqidd 2772 . . . . . . . 8 ((((𝜑𝑌 = ∅) ∧ 𝑡𝐵) ∧ ¬ 𝑡 = 𝑋) → (𝐺𝑡) = (𝐺𝑡))
4139, 40ifeqda 4260 . . . . . . 7 (((𝜑𝑌 = ∅) ∧ 𝑡𝐵) → if(𝑡 = 𝑋, 𝑌, (𝐺𝑡)) = (𝐺𝑡))
4241mpteq2dva 4878 . . . . . 6 ((𝜑𝑌 = ∅) → (𝑡𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺𝑡))) = (𝑡𝐵 ↦ (𝐺𝑡)))
431, 42syl5eq 2817 . . . . 5 ((𝜑𝑌 = ∅) → 𝐹 = (𝑡𝐵 ↦ (𝐺𝑡)))
4417feqmptd 6391 . . . . . 6 (𝜑𝐺 = (𝑡𝐵 ↦ (𝐺𝑡)))
4544adantr 466 . . . . 5 ((𝜑𝑌 = ∅) → 𝐺 = (𝑡𝐵 ↦ (𝐺𝑡)))
4643, 45eqtr4d 2808 . . . 4 ((𝜑𝑌 = ∅) → 𝐹 = 𝐺)
4712adantr 466 . . . 4 ((𝜑𝑌 = ∅) → 𝐺𝑆)
4846, 47eqeltrd 2850 . . 3 ((𝜑𝑌 = ∅) → 𝐹𝑆)
49 oecl 7771 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝑜 𝐵) ∈ On)
5014, 2, 49syl2anc 573 . . . . . . 7 (𝜑 → (𝐴𝑜 𝐵) ∈ On)
5113, 14, 2cantnff 8735 . . . . . . . 8 (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴𝑜 𝐵))
5251, 12ffvelrnd 6503 . . . . . . 7 (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) ∈ (𝐴𝑜 𝐵))
53 onelon 5891 . . . . . . 7 (((𝐴𝑜 𝐵) ∈ On ∧ ((𝐴 CNF 𝐵)‘𝐺) ∈ (𝐴𝑜 𝐵)) → ((𝐴 CNF 𝐵)‘𝐺) ∈ On)
5450, 52, 53syl2anc 573 . . . . . 6 (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) ∈ On)
5554adantr 466 . . . . 5 ((𝜑𝑌 = ∅) → ((𝐴 CNF 𝐵)‘𝐺) ∈ On)
56 oa0r 7772 . . . . 5 (((𝐴 CNF 𝐵)‘𝐺) ∈ On → (∅ +𝑜 ((𝐴 CNF 𝐵)‘𝐺)) = ((𝐴 CNF 𝐵)‘𝐺))
5755, 56syl 17 . . . 4 ((𝜑𝑌 = ∅) → (∅ +𝑜 ((𝐴 CNF 𝐵)‘𝐺)) = ((𝐴 CNF 𝐵)‘𝐺))
58 oveq2 6801 . . . . . 6 (𝑌 = ∅ → ((𝐴𝑜 𝑋) ·𝑜 𝑌) = ((𝐴𝑜 𝑋) ·𝑜 ∅))
59 oecl 7771 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴𝑜 𝑋) ∈ On)
6014, 5, 59syl2anc 573 . . . . . . 7 (𝜑 → (𝐴𝑜 𝑋) ∈ On)
61 om0 7751 . . . . . . 7 ((𝐴𝑜 𝑋) ∈ On → ((𝐴𝑜 𝑋) ·𝑜 ∅) = ∅)
6260, 61syl 17 . . . . . 6 (𝜑 → ((𝐴𝑜 𝑋) ·𝑜 ∅) = ∅)
6358, 62sylan9eqr 2827 . . . . 5 ((𝜑𝑌 = ∅) → ((𝐴𝑜 𝑋) ·𝑜 𝑌) = ∅)
6463oveq1d 6808 . . . 4 ((𝜑𝑌 = ∅) → (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺)) = (∅ +𝑜 ((𝐴 CNF 𝐵)‘𝐺)))
6546fveq2d 6336 . . . 4 ((𝜑𝑌 = ∅) → ((𝐴 CNF 𝐵)‘𝐹) = ((𝐴 CNF 𝐵)‘𝐺))
6657, 64, 653eqtr4rd 2816 . . 3 ((𝜑𝑌 = ∅) → ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺)))
6748, 66jca 501 . 2 ((𝜑𝑌 = ∅) → (𝐹𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺))))
6814adantr 466 . . . 4 ((𝜑𝑌 ≠ ∅) → 𝐴 ∈ On)
692adantr 466 . . . 4 ((𝜑𝑌 ≠ ∅) → 𝐵 ∈ On)
7012adantr 466 . . . 4 ((𝜑𝑌 ≠ ∅) → 𝐺𝑆)
713adantr 466 . . . 4 ((𝜑𝑌 ≠ ∅) → 𝑋𝐵)
72 cantnfp1.y . . . . 5 (𝜑𝑌𝐴)
7372adantr 466 . . . 4 ((𝜑𝑌 ≠ ∅) → 𝑌𝐴)
7428adantr 466 . . . 4 ((𝜑𝑌 ≠ ∅) → (𝐺 supp ∅) ⊆ 𝑋)
7513, 68, 69, 70, 71, 73, 74, 1cantnfp1lem1 8739 . . 3 ((𝜑𝑌 ≠ ∅) → 𝐹𝑆)
76 onelon 5891 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑌𝐴) → 𝑌 ∈ On)
7714, 72, 76syl2anc 573 . . . . . 6 (𝜑𝑌 ∈ On)
78 on0eln0 5923 . . . . . 6 (𝑌 ∈ On → (∅ ∈ 𝑌𝑌 ≠ ∅))
7977, 78syl 17 . . . . 5 (𝜑 → (∅ ∈ 𝑌𝑌 ≠ ∅))
8079biimpar 463 . . . 4 ((𝜑𝑌 ≠ ∅) → ∅ ∈ 𝑌)
81 eqid 2771 . . . 4 OrdIso( E , (𝐹 supp ∅)) = OrdIso( E , (𝐹 supp ∅))
82 eqid 2771 . . . 4 seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴𝑜 (OrdIso( E , (𝐹 supp ∅))‘𝑘)) ·𝑜 (𝐹‘(OrdIso( E , (𝐹 supp ∅))‘𝑘))) +𝑜 𝑧)), ∅) = seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴𝑜 (OrdIso( E , (𝐹 supp ∅))‘𝑘)) ·𝑜 (𝐹‘(OrdIso( E , (𝐹 supp ∅))‘𝑘))) +𝑜 𝑧)), ∅)
83 eqid 2771 . . . 4 OrdIso( E , (𝐺 supp ∅)) = OrdIso( E , (𝐺 supp ∅))
84 eqid 2771 . . . 4 seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴𝑜 (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·𝑜 (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +𝑜 𝑧)), ∅) = seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴𝑜 (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·𝑜 (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +𝑜 𝑧)), ∅)
8513, 68, 69, 70, 71, 73, 74, 1, 80, 81, 82, 83, 84cantnfp1lem3 8741 . . 3 ((𝜑𝑌 ≠ ∅) → ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺)))
8675, 85jca 501 . 2 ((𝜑𝑌 ≠ ∅) → (𝐹𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺))))
8767, 86pm2.61dane 3030 1 (𝜑 → (𝐹𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴𝑜 𝑋) ·𝑜 𝑌) +𝑜 ((𝐴 CNF 𝐵)‘𝐺))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 382   = wceq 1631  wcel 2145  wne 2943  Vcvv 3351  cdif 3720  wss 3723  c0 4063  ifcif 4225   class class class wbr 4786  cmpt 4863   E cep 5161  dom cdm 5249  Ord word 5865  Oncon0 5866   Fn wfn 6026  wf 6027  cfv 6031  (class class class)co 6793  cmpt2 6795   supp csupp 7446  seq𝜔cseqom 7695  1𝑜c1o 7706   +𝑜 coa 7710   ·𝑜 comu 7711  𝑜 coe 7712   finSupp cfsupp 8431  OrdIsocoi 8570   CNF ccnf 8722
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4904  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3or 1072  df-3an 1073  df-tru 1634  df-fal 1637  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-tp 4321  df-op 4323  df-uni 4575  df-int 4612  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-tr 4887  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-se 5209  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-isom 6040  df-riota 6754  df-ov 6796  df-oprab 6797  df-mpt2 6798  df-om 7213  df-1st 7315  df-2nd 7316  df-supp 7447  df-wrecs 7559  df-recs 7621  df-rdg 7659  df-seqom 7696  df-1o 7713  df-2o 7714  df-oadd 7717  df-omul 7718  df-oexp 7719  df-er 7896  df-map 8011  df-en 8110  df-dom 8111  df-sdom 8112  df-fin 8113  df-fsupp 8432  df-oi 8571  df-cnf 8723
This theorem is referenced by:  cantnflem1d  8749  cantnflem1  8750  cantnflem3  8752
  Copyright terms: Public domain W3C validator