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

Theorem suppssOLD 8130
Description: Obsolete version of suppss 8129 as of 5-Aug-2024. (Contributed by Mario Carneiro, 19-Dec-2014.) (Revised by AV, 28-May-2019.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
suppss.f (𝜑𝐹:𝐴𝐵)
suppss.n ((𝜑𝑘 ∈ (𝐴𝑊)) → (𝐹𝑘) = 𝑍)
Assertion
Ref Expression
suppssOLD (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)
Distinct variable groups:   𝑘,𝐹   𝜑,𝑘   𝑘,𝑊   𝑘,𝑍
Allowed substitution hints:   𝐴(𝑘)   𝐵(𝑘)

Proof of Theorem suppssOLD
StepHypRef Expression
1 suppss.f . . . . . . . 8 (𝜑𝐹:𝐴𝐵)
21ffnd 6673 . . . . . . 7 (𝜑𝐹 Fn 𝐴)
32adantl 483 . . . . . 6 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝐹 Fn 𝐴)
4 fdm 6681 . . . . . . . 8 (𝐹:𝐴𝐵 → dom 𝐹 = 𝐴)
5 dmexg 7844 . . . . . . . . . 10 (𝐹 ∈ V → dom 𝐹 ∈ V)
65adantr 482 . . . . . . . . 9 ((𝐹 ∈ V ∧ 𝑍 ∈ V) → dom 𝐹 ∈ V)
7 eleq1 2822 . . . . . . . . . 10 (𝐴 = dom 𝐹 → (𝐴 ∈ V ↔ dom 𝐹 ∈ V))
87eqcoms 2741 . . . . . . . . 9 (dom 𝐹 = 𝐴 → (𝐴 ∈ V ↔ dom 𝐹 ∈ V))
96, 8imbitrrid 245 . . . . . . . 8 (dom 𝐹 = 𝐴 → ((𝐹 ∈ V ∧ 𝑍 ∈ V) → 𝐴 ∈ V))
101, 4, 93syl 18 . . . . . . 7 (𝜑 → ((𝐹 ∈ V ∧ 𝑍 ∈ V) → 𝐴 ∈ V))
1110impcom 409 . . . . . 6 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝐴 ∈ V)
12 simplr 768 . . . . . 6 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝑍 ∈ V)
13 elsuppfn 8106 . . . . . 6 ((𝐹 Fn 𝐴𝐴 ∈ V ∧ 𝑍 ∈ V) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
143, 11, 12, 13syl3anc 1372 . . . . 5 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
15 eldif 3924 . . . . . . . . 9 (𝑘 ∈ (𝐴𝑊) ↔ (𝑘𝐴 ∧ ¬ 𝑘𝑊))
16 suppss.n . . . . . . . . . 10 ((𝜑𝑘 ∈ (𝐴𝑊)) → (𝐹𝑘) = 𝑍)
1716adantll 713 . . . . . . . . 9 ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘 ∈ (𝐴𝑊)) → (𝐹𝑘) = 𝑍)
1815, 17sylan2br 596 . . . . . . . 8 ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ (𝑘𝐴 ∧ ¬ 𝑘𝑊)) → (𝐹𝑘) = 𝑍)
1918expr 458 . . . . . . 7 ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘𝐴) → (¬ 𝑘𝑊 → (𝐹𝑘) = 𝑍))
2019necon1ad 2957 . . . . . 6 ((((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) ∧ 𝑘𝐴) → ((𝐹𝑘) ≠ 𝑍𝑘𝑊))
2120expimpd 455 . . . . 5 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → ((𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) → 𝑘𝑊))
2214, 21sylbid 239 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝑘 ∈ (𝐹 supp 𝑍) → 𝑘𝑊))
2322ssrdv 3954 . . 3 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) ⊆ 𝑊)
2423ex 414 . 2 ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊))
25 supp0prc 8099 . . . 4 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅)
26 0ss 4360 . . . 4 ∅ ⊆ 𝑊
2725, 26eqsstrdi 4002 . . 3 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) ⊆ 𝑊)
2827a1d 25 . 2 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊))
2924, 28pm2.61i 182 1 (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 397   = wceq 1542  wcel 2107  wne 2940  Vcvv 3447  cdif 3911  wss 3914  c0 4286  dom cdm 5637   Fn wfn 6495  wf 6496  cfv 6500  (class class class)co 7361   supp csupp 8096
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5246  ax-sep 5260  ax-nul 5267  ax-pr 5388  ax-un 7676
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3353  df-rab 3407  df-v 3449  df-sbc 3744  df-csb 3860  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4287  df-if 4491  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4870  df-iun 4960  df-br 5110  df-opab 5172  df-mpt 5193  df-id 5535  df-xp 5643  df-rel 5644  df-cnv 5645  df-co 5646  df-dm 5647  df-rn 5648  df-res 5649  df-ima 5650  df-iota 6452  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7364  df-oprab 7365  df-mpo 7366  df-supp 8097
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator