| 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 5541 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) | |
| 2 | opabresid 6054 | . . 3 ⊢ ( I ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} | |
| 3 | 2 | eqeq1i 2770 | . 2 ⊢ (( I ↾ 𝐴) = ∅ ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)} = ∅) |
| 4 | nel02 4292 | . . . . 5 ⊢ (𝐴 = ∅ → ¬ 𝑥 ∈ 𝐴) | |
| 5 | 4 | intnanrd 495 | . . . 4 ⊢ (𝐴 = ∅ → ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) |
| 6 | 5 | alrimivv 1961 | . . 3 ⊢ (𝐴 = ∅ → ∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥)) |
| 7 | ianor 997 | . . . . . . 7 ⊢ (¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥)) | |
| 8 | 7 | albii 1852 | . . . . . 6 ⊢ (∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) ↔ ∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥)) |
| 9 | 19.32v 1973 | . . . . . . 7 ⊢ (∀𝑦(¬ 𝑥 ∈ 𝐴 ∨ ¬ 𝑦 = 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∨ ∀𝑦 ¬ 𝑦 = 𝑥)) | |
| 10 | id 23 | . . . . . . . 8 ⊢ (¬ 𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐴) | |
| 11 | ax6v 2001 | . . . . . . . . 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 1844 | . . . 4 ⊢ (∀𝑥∀𝑦 ¬ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝑥) → ∀𝑥 ¬ 𝑥 ∈ 𝐴) |
| 17 | eq0 4304 | . . . 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 1568 = wceq 1570 ∈ wcel 2146 ∅c0 4286 {copab 5175 I cid 5557 ↾ cres 5665 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-res 5675 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |