| 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 2842 | . . . . . . 7 ⊢ (𝐴 ∈ V → ∃𝑥 𝑥 = 𝐴) | |
| 2 | eqeng 9013 | . . . . . . . . 9 ⊢ (𝑥 ∈ V → (𝑥 = 𝐴 → 𝑥 ≈ 𝐴)) | |
| 3 | 2 | elv 3456 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → 𝑥 ≈ 𝐴) |
| 4 | 3 | eximi 1868 | . . . . . . 7 ⊢ (∃𝑥 𝑥 = 𝐴 → ∃𝑥 𝑥 ≈ 𝐴) |
| 5 | 1, 4 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ V → ∃𝑥 𝑥 ≈ 𝐴) |
| 6 | abn0 4334 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ ∃𝑥 𝑥 ≈ 𝐴) | |
| 7 | 5, 6 | sylibr 237 | . . . . 5 ⊢ (𝐴 ∈ V → {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 8 | scott0b 9937 | . . . . . 6 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} = ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} = ∅) | |
| 9 | 8 | necon3bii 3008 | . . . . 5 ⊢ ({𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 10 | 7, 9 | sylib 221 | . . . 4 ⊢ (𝐴 ∈ V → Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 11 | kardval 35820 | . . . . 5 ⊢ (kard‘𝐴) = Scott {𝑥 ∣ 𝑥 ≈ 𝐴} | |
| 12 | 11 | neeq1i 3020 | . . . 4 ⊢ ((kard‘𝐴) ≠ ∅ ↔ Scott {𝑥 ∣ 𝑥 ≈ 𝐴} ≠ ∅) |
| 13 | 10, 12 | sylibr 237 | . . 3 ⊢ (𝐴 ∈ V → (kard‘𝐴) ≠ ∅) |
| 14 | 13 | necon2bi 2986 | . 2 ⊢ ((kard‘𝐴) = ∅ → ¬ 𝐴 ∈ V) |
| 15 | fvprc 6877 | . 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 2739 ≠ wne 2956 Vcvv 3451 ∅c0 4279 class class class wbr 5103 ‘cfv 6538 ≈ cen 8970 Scott cscott 9928 kardckard 35817 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-reg 9586 ax-inf2 9642 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-en 8974 df-r1 9768 df-rank 9769 df-scott 9929 df-kard 35818 |
| This theorem is used by: karddom 35829 kardsdom 35830 kardcard2b 35833 rankkardu 35839 |
| Copyright terms: Public domain | W3C validator |