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

Theorem iresn0n0 6064
Description: The identity function restricted to a class 𝐴 is empty iff the class 𝐴 is empty. (Contributed by AV, 30-Jan-2024.)
Assertion
Ref Expression
iresn0n0 (𝐴 = ∅ ↔ ( I ↾ 𝐴) = ∅)

Proof of Theorem iresn0n0
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opab0 5536 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥))
2 opabresid 6060 . . 3 ( I ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)}
32eqeq1i 2768 . 2 (( I ↾ 𝐴) = ∅ ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} = ∅)
4 nel02 4288 . . . . 5 (𝐴 = ∅ → ¬ 𝑥 ∈ 𝐴)
54intnanrd 495 . . . 4 (𝐴 = ∅ → ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥))
65alrimivv 1963 . . 3 (𝐴 = ∅ → ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥))
7 ianor 997 . . . . . . 7 (¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥))
87albii 1852 . . . . . 6 (∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) ↔ ∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥))
9 19.32v 1975 . . . . . . 7 (∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ∀𝑦 ¬ 𝑦 = 𝑥))
10 id 23 . . . . . . . 8 (¬ 𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐴)
11 ax6v 2003 . . . . . . . . 9 ¬ ∀𝑦 ¬ 𝑦 = 𝑥
1211pm2.21i 120 . . . . . . . 8 (∀𝑦 ¬ 𝑦 = 𝑥 → ¬ 𝑥 ∈ 𝐴)
1310, 12jaoi 871 . . . . . . 7 ((¬ 𝑥 ∈ 𝐴 ∨ ∀𝑦 ¬ 𝑦 = 𝑥) → ¬ 𝑥 ∈ 𝐴)
149, 13sylbi 220 . . . . . 6 (∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥) → ¬ 𝑥 ∈ 𝐴)
158, 14sylbi 220 . . . . 5 (∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → ¬ 𝑥 ∈ 𝐴)
1615alimi 1844 . . . 4 (∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → ∀𝑥 ¬ 𝑥 ∈ 𝐴)
17 eq0 4300 . . . 4 (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴)
1816, 17sylibr 237 . . 3 (∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → 𝐴 = ∅)
196, 18impbii 212 . 2 (𝐴 = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥))
201, 3, 193bitr4ri 307 1 (𝐴 = ∅ ↔ ( I ↾ 𝐴) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∅c0 4281  {copab 5173   I cid 5552   ↾ cres 5660
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-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
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-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 4841  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-res 5670
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator