| 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 2845 | . . . . . . 7 ⊢ (𝐴 ∈ V → ∃𝑥 𝑥 = 𝐴) | |
| 2 | eqeng 9051 | . . . . . . . . 9 ⊢ (𝑥 ∈ V → (𝑥 = 𝐴 → 𝑥 ≈ 𝐴)) | |
| 3 | 2 | elv 3459 | . . . . . . . 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 9974 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} = ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} = ∅) | |
| 9 | 8 | necon3bii 3011 | . . . . 5 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 10 | 7, 9 | sylib 221 | . . . 4 ⊢ (𝐴 ∈ V → Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 11 | kardval 35961 | . . . . 5 ⊢ (kard‘𝐴) = Scott {𝑥 ∣ 𝑥 ≈ 𝐴} | |
| 12 | 11 | neeq1i 3023 | . . . 4 ⊢ ((kard‘𝐴) ≠ ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 13 | 10, 12 | sylibr 237 | . . 3 ⊢ (𝐴 ∈ V → (kard‘𝐴) ≠ ∅) |
| 14 | 13 | necon2bi 2989 | . 2 ⊢ ((kard‘𝐴) = ∅ → ¬ 𝐴 ∈ V) |
| 15 | fvprc 6908 | . 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 2147 {cab 2741 ≠ wne 2959 Vcvv 3454 ∅c0 4281 class class class wbr 5108 ‘cfv 6566 ≈ cen 9008 Scott cscott 9965 kardckard 35958 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-reg 9623 ax-inf2 9679 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-en 9012 df-r1 9805 df-rank 9806 df-scott 9966 df-kard 35959 |
| This theorem is used by: karddom 35970 kardsdom 35971 kardcard2b 35974 rankkardu 35980 |
| Copyright terms: Public domain | W3C validator |