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

Theorem suppssrst 6460
Description: A function is zero outside its support. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by AV, 28-May-2019.)
Hypotheses
Ref Expression
suppssr.f (𝜑𝐹:𝐴𝐵)
suppssr.n (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)
suppssr.a (𝜑𝐴𝑉)
suppssrst.z (𝜑𝑍𝐵)
suppssrst.st (𝜑 → ∀𝑢𝐵𝑣𝐵 STAB 𝑢 = 𝑣)
Assertion
Ref Expression
suppssrst ((𝜑𝑋 ∈ (𝐴𝑊)) → (𝐹𝑋) = 𝑍)
Distinct variable groups:   𝑢,𝐵,𝑣   𝑢,𝐹,𝑣   𝑢,𝑋,𝑣   𝑣,𝑍
Allowed substitution hints:   𝜑(𝑣,𝑢)   𝐴(𝑣,𝑢)   𝑉(𝑣,𝑢)   𝑊(𝑣,𝑢)   𝑍(𝑢)

Proof of Theorem suppssrst
StepHypRef Expression
1 eldif 3219 . 2 (𝑋 ∈ (𝐴𝑊) ↔ (𝑋𝐴 ∧ ¬ 𝑋𝑊))
2 df-ne 2413 . . . . . 6 ((𝐹𝑋) ≠ 𝑍 ↔ ¬ (𝐹𝑋) = 𝑍)
3 suppssr.f . . . . . . . . . . 11 (𝜑𝐹:𝐴𝐵)
4 suppssr.a . . . . . . . . . . 11 (𝜑𝐴𝑉)
53, 4fexd 5915 . . . . . . . . . 10 (𝜑𝐹 ∈ V)
6 fvexg 5688 . . . . . . . . . 10 ((𝐹 ∈ V ∧ 𝑋𝐴) → (𝐹𝑋) ∈ V)
75, 6sylan 283 . . . . . . . . 9 ((𝜑𝑋𝐴) → (𝐹𝑋) ∈ V)
87biantrurd 305 . . . . . . . 8 ((𝜑𝑋𝐴) → ((𝐹𝑋) ≠ 𝑍 ↔ ((𝐹𝑋) ∈ V ∧ (𝐹𝑋) ≠ 𝑍)))
9 eldifsn 3819 . . . . . . . 8 ((𝐹𝑋) ∈ (V ∖ {𝑍}) ↔ ((𝐹𝑋) ∈ V ∧ (𝐹𝑋) ≠ 𝑍))
108, 9bitr4di 198 . . . . . . 7 ((𝜑𝑋𝐴) → ((𝐹𝑋) ≠ 𝑍 ↔ (𝐹𝑋) ∈ (V ∖ {𝑍})))
113ffnd 5508 . . . . . . . . . . 11 (𝜑𝐹 Fn 𝐴)
12 suppssrst.z . . . . . . . . . . 11 (𝜑𝑍𝐵)
13 elsuppfn 6442 . . . . . . . . . . 11 ((𝐹 Fn 𝐴𝐴𝑉𝑍𝐵) → (𝑋 ∈ (𝐹 supp 𝑍) ↔ (𝑋𝐴 ∧ (𝐹𝑋) ≠ 𝑍)))
1411, 4, 12, 13syl3anc 1274 . . . . . . . . . 10 (𝜑 → (𝑋 ∈ (𝐹 supp 𝑍) ↔ (𝑋𝐴 ∧ (𝐹𝑋) ≠ 𝑍)))
1510pm5.32da 452 . . . . . . . . . 10 (𝜑 → ((𝑋𝐴 ∧ (𝐹𝑋) ≠ 𝑍) ↔ (𝑋𝐴 ∧ (𝐹𝑋) ∈ (V ∖ {𝑍}))))
1614, 15bitrd 188 . . . . . . . . 9 (𝜑 → (𝑋 ∈ (𝐹 supp 𝑍) ↔ (𝑋𝐴 ∧ (𝐹𝑋) ∈ (V ∖ {𝑍}))))
17 suppssr.n . . . . . . . . . 10 (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)
1817sseld 3236 . . . . . . . . 9 (𝜑 → (𝑋 ∈ (𝐹 supp 𝑍) → 𝑋𝑊))
1916, 18sylbird 170 . . . . . . . 8 (𝜑 → ((𝑋𝐴 ∧ (𝐹𝑋) ∈ (V ∖ {𝑍})) → 𝑋𝑊))
2019expdimp 259 . . . . . . 7 ((𝜑𝑋𝐴) → ((𝐹𝑋) ∈ (V ∖ {𝑍}) → 𝑋𝑊))
2110, 20sylbid 150 . . . . . 6 ((𝜑𝑋𝐴) → ((𝐹𝑋) ≠ 𝑍𝑋𝑊))
222, 21biimtrrid 153 . . . . 5 ((𝜑𝑋𝐴) → (¬ (𝐹𝑋) = 𝑍𝑋𝑊))
2322con3d 636 . . . 4 ((𝜑𝑋𝐴) → (¬ 𝑋𝑊 → ¬ ¬ (𝐹𝑋) = 𝑍))
24 eqeq2 2242 . . . . . . 7 (𝑣 = 𝑍 → ((𝐹𝑋) = 𝑣 ↔ (𝐹𝑋) = 𝑍))
2524stbid 840 . . . . . 6 (𝑣 = 𝑍 → (STAB (𝐹𝑋) = 𝑣STAB (𝐹𝑋) = 𝑍))
26 eqeq1 2239 . . . . . . . . 9 (𝑢 = (𝐹𝑋) → (𝑢 = 𝑣 ↔ (𝐹𝑋) = 𝑣))
2726stbid 840 . . . . . . . 8 (𝑢 = (𝐹𝑋) → (STAB 𝑢 = 𝑣STAB (𝐹𝑋) = 𝑣))
2827ralbidv 2542 . . . . . . 7 (𝑢 = (𝐹𝑋) → (∀𝑣𝐵 STAB 𝑢 = 𝑣 ↔ ∀𝑣𝐵 STAB (𝐹𝑋) = 𝑣))
29 suppssrst.st . . . . . . . 8 (𝜑 → ∀𝑢𝐵𝑣𝐵 STAB 𝑢 = 𝑣)
3029adantr 276 . . . . . . 7 ((𝜑𝑋𝐴) → ∀𝑢𝐵𝑣𝐵 STAB 𝑢 = 𝑣)
313ffvelcdmda 5811 . . . . . . 7 ((𝜑𝑋𝐴) → (𝐹𝑋) ∈ 𝐵)
3228, 30, 31rspcdva 2925 . . . . . 6 ((𝜑𝑋𝐴) → ∀𝑣𝐵 STAB (𝐹𝑋) = 𝑣)
3312adantr 276 . . . . . 6 ((𝜑𝑋𝐴) → 𝑍𝐵)
3425, 32, 33rspcdva 2925 . . . . 5 ((𝜑𝑋𝐴) → STAB (𝐹𝑋) = 𝑍)
35 df-stab 839 . . . . 5 (STAB (𝐹𝑋) = 𝑍 ↔ (¬ ¬ (𝐹𝑋) = 𝑍 → (𝐹𝑋) = 𝑍))
3634, 35sylib 122 . . . 4 ((𝜑𝑋𝐴) → (¬ ¬ (𝐹𝑋) = 𝑍 → (𝐹𝑋) = 𝑍))
3723, 36syld 45 . . 3 ((𝜑𝑋𝐴) → (¬ 𝑋𝑊 → (𝐹𝑋) = 𝑍))
3837impr 379 . 2 ((𝜑 ∧ (𝑋𝐴 ∧ ¬ 𝑋𝑊)) → (𝐹𝑋) = 𝑍)
391, 38sylan2b 287 1 ((𝜑𝑋 ∈ (𝐴𝑊)) → (𝐹𝑋) = 𝑍)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  STAB wstab 838   = wceq 1398  wcel 2203  wne 2412  wral 2520  Vcvv 2812  cdif 3207  wss 3210  {csn 3688   Fn wfn 5346  wf 5347  cfv 5351  (class class class)co 6049   supp csupp 6434
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658
This theorem depends on definitions:  df-bi 117  df-stab 839  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-supp 6435
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator