| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iresn0n0 | Structured version Visualization version GIF version | ||
| Description: The identity function restricted to a class 𝐴 is empty iff the class 𝐴 is empty. (Contributed by AV, 30-Jan-2024.) |
| Ref | Expression |
|---|---|
| iresn0n0 | ⊢ (𝐴 = ∅ ↔ ( I ↾ 𝐴) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opab0 5528 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) | |
| 2 | opabresid 6041 | . . 3 ⊢ ( I ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} | |
| 3 | 2 | eqeq1i 2765 | . 2 ⊢ (( I ↾ 𝐴) = ∅ ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} = ∅) |
| 4 | nel02 4284 | . . . . 5 ⊢ (𝐴 = ∅ → ¬ 𝑥 ∈ 𝐴) | |
| 5 | 4 | intnanrd 495 | . . . 4 ⊢ (𝐴 = ∅ → ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) |
| 6 | 5 | alrimivv 1960 | . . 3 ⊢ (𝐴 = ∅ → ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) |
| 7 | ianor 997 | . . . . . . 7 ⊢ (¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥)) | |
| 8 | 7 | albii 1851 | . . . . . 6 ⊢ (∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) ↔ ∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥)) |
| 9 | 19.32v 1972 | . . . . . . 7 ⊢ (∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ∀𝑦 ¬ 𝑦 = 𝑥)) | |
| 10 | id 23 | . . . . . . . 8 ⊢ (¬ 𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐴) | |
| 11 | ax6v 2000 | . . . . . . . . 9 ⊢ ¬ ∀𝑦 ¬ 𝑦 = 𝑥 | |
| 12 | 11 | pm2.21i 120 | . . . . . . . 8 ⊢ (∀𝑦 ¬ 𝑦 = 𝑥 → ¬ 𝑥 ∈ 𝐴) |
| 13 | 10, 12 | jaoi 871 | . . . . . . 7 ⊢ ((¬ 𝑥 ∈ 𝐴 ∨ ∀𝑦 ¬ 𝑦 = 𝑥) → ¬ 𝑥 ∈ 𝐴) |
| 14 | 9, 13 | sylbi 220 | . . . . . 6 ⊢ (∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥) → ¬ 𝑥 ∈ 𝐴) |
| 15 | 8, 14 | sylbi 220 | . . . . 5 ⊢ (∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → ¬ 𝑥 ∈ 𝐴) |
| 16 | 15 | alimi 1843 | . . . 4 ⊢ (∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 17 | eq0 4296 | . . . 4 ⊢ (𝐴 = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ 𝐴) | |
| 18 | 16, 17 | sylibr 237 | . . 3 ⊢ (∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → 𝐴 = ∅) |
| 19 | 6, 18 | impbii 212 | . 2 ⊢ (𝐴 = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) |
| 20 | 1, 3, 19 | 3bitr4ri 307 | 1 ⊢ (𝐴 = ∅ ↔ ( I ↾ 𝐴) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∀wal 1567 = wceq 1569 ∈ wcel 2144 ∅c0 4278 {copab 5166 I cid 5544 ↾ cres 5652 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-res 5662 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |