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

Theorem fvclss 7268
Description: Upper bound for the class of values of a class. (Contributed by NM, 9-Nov-1995.)
Assertion
Ref Expression
fvclss {𝑦 ∣ ∃𝑥 𝑦 = (𝐹‘𝑥)} ⊆ (ran 𝐹 ∪ {∅})
Distinct variable group:   𝑥,𝑦,𝐹

Proof of Theorem fvclss
StepHypRef Expression
1 eqcom 2770 . . . . . . . . . 10 (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
2 tz6.12i 6934 . . . . . . . . . 10 (𝑦 ≠ ∅ → ((𝐹‘𝑥) = 𝑦 → 𝑥𝐹𝑦))
31, 2biimtrid 245 . . . . . . . . 9 (𝑦 ≠ ∅ → (𝑦 = (𝐹‘𝑥) → 𝑥𝐹𝑦))
43eximdv 1952 . . . . . . . 8 (𝑦 ≠ ∅ → (∃𝑥 𝑦 = (𝐹‘𝑥) → ∃𝑥 𝑥𝐹𝑦))
5 vex 3458 . . . . . . . . 9 𝑦 ∈ V
65elrn 5882 . . . . . . . 8 (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 𝑥𝐹𝑦)
74, 6imbitrrdi 255 . . . . . . 7 (𝑦 ≠ ∅ → (∃𝑥 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ ran 𝐹))
87com12 33 . . . . . 6 (∃𝑥 𝑦 = (𝐹‘𝑥) → (𝑦 ≠ ∅ → 𝑦 ∈ ran 𝐹))
98necon1bd 2977 . . . . 5 (∃𝑥 𝑦 = (𝐹‘𝑥) → (¬ 𝑦 ∈ ran 𝐹 → 𝑦 = ∅))
10 velsn 4600 . . . . 5 (𝑦 ∈ {∅} ↔ 𝑦 = ∅)
119, 10imbitrrdi 255 . . . 4 (∃𝑥 𝑦 = (𝐹‘𝑥) → (¬ 𝑦 ∈ ran 𝐹 → 𝑦 ∈ {∅}))
1211orrd 877 . . 3 (∃𝑥 𝑦 = (𝐹‘𝑥) → (𝑦 ∈ ran 𝐹 ∨ 𝑦 ∈ {∅}))
1312ss2abi 3994 . 2 {𝑦 ∣ ∃𝑥 𝑦 = (𝐹‘𝑥)} ⊆ {𝑦 ∣ (𝑦 ∈ ran 𝐹 ∨ 𝑦 ∈ {∅})}
14 df-un 4154 . 2 (ran 𝐹 ∪ {∅}) = {𝑦 ∣ (𝑦 ∈ ran 𝐹 ∨ 𝑦 ∈ {∅})}
1513, 14sseqtrri 3962 1 {𝑦 ∣ ∃𝑥 𝑦 = (𝐹‘𝑥)} ⊆ (ran 𝐹 ∪ {∅})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  {csn 4588   class class class wbr 5106  ran crn 5656  ‘cfv 6558
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-cnv 5663  df-dm 5665  df-rn 5666  df-iota 6512  df-fv 6566
This theorem is used by:  fvclex  7995
  Copyright terms: Public domain W3C validator