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

Theorem ress0 16552
Description: All restrictions of the null set are trivial. (Contributed by Stefan O'Rear, 29-Nov-2014.) (Revised by Mario Carneiro, 30-Apr-2015.)
Assertion
Ref Expression
ress0 (∅ ↾s 𝐴) = ∅

Proof of Theorem ress0
StepHypRef Expression
1 0ss 4349 . . 3 ∅ ⊆ 𝐴
2 0ex 5203 . . 3 ∅ ∈ V
3 eqid 2821 . . . 4 (∅ ↾s 𝐴) = (∅ ↾s 𝐴)
4 base0 16530 . . . 4 ∅ = (Base‘∅)
53, 4ressid2 16546 . . 3 ((∅ ⊆ 𝐴 ∧ ∅ ∈ V ∧ 𝐴 ∈ V) → (∅ ↾s 𝐴) = ∅)
61, 2, 5mp3an12 1447 . 2 (𝐴 ∈ V → (∅ ↾s 𝐴) = ∅)
7 reldmress 16544 . . 3 Rel dom ↾s
87ovprc2 7190 . 2 𝐴 ∈ V → (∅ ↾s 𝐴) = ∅)
96, 8pm2.61i 184 1 (∅ ↾s 𝐴) = ∅
Colors of variables: wff setvar class
Syntax hints:   = wceq 1533  wcel 2110  Vcvv 3494  wss 3935  c0 4290  (class class class)co 7150  s cress 16478
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-slot 16481  df-base 16483  df-ress 16485
This theorem is referenced by:  ressress  16556  symgval  18491  invrfval  19417  mplval  20202  ply1val  20356  dsmmval  20872  dsmmval2  20874  resvsca  30898
  Copyright terms: Public domain W3C validator