| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mapprc | GIF version | ||
| Description: When 𝐴 is a proper class, the class of all functions mapping 𝐴 to 𝐵 is empty. Exercise 4.41 of [Mendelson] p. 255. (Contributed by NM, 8-Dec-2003.) |
| Ref | Expression |
|---|---|
| mapprc | ⊢ (¬ 𝐴 ∈ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abn0m 3536 | . . . 4 ⊢ (∃𝑔 𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↔ ∃𝑓 𝑓:𝐴⟶𝐵) | |
| 2 | fdm 5516 | . . . . . 6 ⊢ (𝑓:𝐴⟶𝐵 → dom 𝑓 = 𝐴) | |
| 3 | vex 2818 | . . . . . . 7 ⊢ 𝑓 ∈ V | |
| 4 | 3 | dmex 5026 | . . . . . 6 ⊢ dom 𝑓 ∈ V |
| 5 | 2, 4 | eqeltrrdi 2326 | . . . . 5 ⊢ (𝑓:𝐴⟶𝐵 → 𝐴 ∈ V) |
| 6 | 5 | exlimiv 1647 | . . . 4 ⊢ (∃𝑓 𝑓:𝐴⟶𝐵 → 𝐴 ∈ V) |
| 7 | 1, 6 | sylbi 121 | . . 3 ⊢ (∃𝑔 𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} → 𝐴 ∈ V) |
| 8 | 7 | con3i 637 | . 2 ⊢ (¬ 𝐴 ∈ V → ¬ ∃𝑔 𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵}) |
| 9 | notm0 3531 | . 2 ⊢ (¬ ∃𝑔 𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↔ {𝑓 ∣ 𝑓:𝐴⟶𝐵} = ∅) | |
| 10 | 8, 9 | sylib 122 | 1 ⊢ (¬ 𝐴 ∈ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} = ∅) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1398 ∃wex 1541 ∈ wcel 2205 {cab 2220 Vcvv 2815 ∅c0 3510 dom cdm 4751 ⟶wf 5350 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-rex 2528 df-v 2817 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-br 4112 df-opab 4174 df-cnv 4759 df-dm 4761 df-rn 4762 df-fn 5357 df-f 5358 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |