Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fiunsnnn | GIF version |
Description: Adding one element to a finite set which is equinumerous to a natural number. (Contributed by Jim Kingdon, 13-Sep-2021.) |
Ref | Expression |
---|---|
fiunsnnn | ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → (𝐴 ∪ {𝐵}) ≈ suc 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simprr 506 | . . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → 𝐴 ≈ 𝑁) | |
2 | en2sn 6675 | . . . 4 ⊢ ((𝐵 ∈ (V ∖ 𝐴) ∧ 𝑁 ∈ ω) → {𝐵} ≈ {𝑁}) | |
3 | 2 | ad2ant2lr 501 | . . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → {𝐵} ≈ {𝑁}) |
4 | simplr 504 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → 𝐵 ∈ (V ∖ 𝐴)) | |
5 | 4 | eldifbd 3053 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → ¬ 𝐵 ∈ 𝐴) |
6 | disjsn 3555 | . . . 4 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴) | |
7 | 5, 6 | sylibr 133 | . . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → (𝐴 ∩ {𝐵}) = ∅) |
8 | elirr 4426 | . . . . 5 ⊢ ¬ 𝑁 ∈ 𝑁 | |
9 | disjsn 3555 | . . . . 5 ⊢ ((𝑁 ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ 𝑁) | |
10 | 8, 9 | mpbir 145 | . . . 4 ⊢ (𝑁 ∩ {𝑁}) = ∅ |
11 | 10 | a1i 9 | . . 3 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → (𝑁 ∩ {𝑁}) = ∅) |
12 | unen 6678 | . . 3 ⊢ (((𝐴 ≈ 𝑁 ∧ {𝐵} ≈ {𝑁}) ∧ ((𝐴 ∩ {𝐵}) = ∅ ∧ (𝑁 ∩ {𝑁}) = ∅)) → (𝐴 ∪ {𝐵}) ≈ (𝑁 ∪ {𝑁})) | |
13 | 1, 3, 7, 11, 12 | syl22anc 1202 | . 2 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → (𝐴 ∪ {𝐵}) ≈ (𝑁 ∪ {𝑁})) |
14 | df-suc 4263 | . 2 ⊢ suc 𝑁 = (𝑁 ∪ {𝑁}) | |
15 | 13, 14 | breqtrrdi 3940 | 1 ⊢ (((𝐴 ∈ Fin ∧ 𝐵 ∈ (V ∖ 𝐴)) ∧ (𝑁 ∈ ω ∧ 𝐴 ≈ 𝑁)) → (𝐴 ∪ {𝐵}) ≈ suc 𝑁) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 = wceq 1316 ∈ wcel 1465 Vcvv 2660 ∖ cdif 3038 ∪ cun 3039 ∩ cin 3040 ∅c0 3333 {csn 3497 class class class wbr 3899 suc csuc 4257 ωcom 4474 ≈ cen 6600 Fincfn 6602 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-nul 4024 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-ral 2398 df-rex 2399 df-v 2662 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-nul 3334 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-id 4185 df-suc 4263 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-fun 5095 df-fn 5096 df-f 5097 df-f1 5098 df-fo 5099 df-f1o 5100 df-1o 6281 df-er 6397 df-en 6603 |
This theorem is referenced by: php5fin 6744 hashunlem 10505 |
Copyright terms: Public domain | W3C validator |