| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > kardeq0 | Structured version Visualization version GIF version | ||
| Description: Applying kard to a class yields the empty set iff the class is a proper class. (Contributed by BTernaryTau, 3-Jul-2026.) |
| Ref | Expression |
|---|---|
| kardeq0 | ⊢ ((kard‘𝐴) = ∅ ↔ ¬ 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elissetv 2843 | . . . . . . 7 ⊢ (𝐴 ∈ V → ∃𝑥 𝑥 = 𝐴) | |
| 2 | eqeng 8995 | . . . . . . . . 9 ⊢ (𝑥 ∈ V → (𝑥 = 𝐴 → 𝑥 ≈ 𝐴)) | |
| 3 | 2 | elv 3458 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → 𝑥 ≈ 𝐴) |
| 4 | 3 | eximi 1868 | . . . . . . 7 ⊢ (∃𝑥 𝑥 = 𝐴 → ∃𝑥 𝑥 ≈ 𝐴) |
| 5 | 1, 4 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ V → ∃𝑥 𝑥 ≈ 𝐴) |
| 6 | abn0 4337 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 𝑥 ≈ 𝐴) | |
| 7 | 5, 6 | sylibr 237 | . . . . 5 ⊢ (𝐴 ∈ V → {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 8 | scott0b 9879 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} = ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} = ∅) | |
| 9 | 8 | necon3bii 3009 | . . . . 5 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 10 | 7, 9 | sylib 221 | . . . 4 ⊢ (𝐴 ∈ V → Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 11 | kardval 35665 | . . . . 5 ⊢ (kard‘𝐴) = Scott {𝑥 ∣ 𝑥 ≈ 𝐴} | |
| 12 | 11 | neeq1i 3021 | . . . 4 ⊢ ((kard‘𝐴) ≠ ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 13 | 10, 12 | sylibr 237 | . . 3 ⊢ (𝐴 ∈ V → (kard‘𝐴) ≠ ∅) |
| 14 | 13 | necon2bi 2987 | . 2 ⊢ ((kard‘𝐴) = ∅ → ¬ 𝐴 ∈ V) |
| 15 | fvprc 6874 | . 2 ⊢ (¬ 𝐴 ∈ V → (kard‘𝐴) = ∅) | |
| 16 | 14, 15 | impbii 212 | 1 ⊢ ((kard‘𝐴) = ∅ ↔ ¬ 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1570 ∃wex 1812 ∈ wcel 2145 {cab 2740 ≠ wne 2957 Vcvv 3453 ∅c0 4282 class class class wbr 5107 ‘cfv 6537 ≈ cen 8952 Scott cscott 9870 kardckard 35662 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-reg 9567 ax-inf2 9623 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-om 7866 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-en 8956 df-r1 9749 df-rank 9750 df-scott 9871 df-kard 35663 |
| This theorem is used by: karddom 35674 kardsdom 35675 kardcard2b 35678 rankkardu 35684 |
| Copyright terms: Public domain | W3C validator |