![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > phplem1 | GIF version |
Description: Lemma for Pigeonhole Principle. If we join a natural number to itself minus an element, we end up with its successor minus the same element. (Contributed by NM, 25-May-1998.) |
Ref | Expression |
---|---|
phplem1 | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnord 4352 | . . 3 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
2 | nordeq 4287 | . . . 4 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐴 ≠ 𝐵) | |
3 | disjsn2 3455 | . . . 4 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
4 | 2, 3 | syl 14 | . . 3 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∩ {𝐵}) = ∅) |
5 | 1, 4 | sylan 277 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∩ {𝐵}) = ∅) |
6 | undif4 3306 | . . 3 ⊢ (({𝐴} ∩ {𝐵}) = ∅ → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (({𝐴} ∪ 𝐴) ∖ {𝐵})) | |
7 | df-suc 4126 | . . . . 5 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
8 | 7 | equncomi 3118 | . . . 4 ⊢ suc 𝐴 = ({𝐴} ∪ 𝐴) |
9 | 8 | difeq1i 3086 | . . 3 ⊢ (suc 𝐴 ∖ {𝐵}) = (({𝐴} ∪ 𝐴) ∖ {𝐵}) |
10 | 6, 9 | syl6eqr 2131 | . 2 ⊢ (({𝐴} ∩ {𝐵}) = ∅ → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
11 | 5, 10 | syl 14 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1284 ∈ wcel 1433 ≠ wne 2245 ∖ cdif 2970 ∪ cun 2971 ∩ cin 2972 ∅c0 3251 {csn 3398 Ord word 4117 suc csuc 4120 ωcom 4331 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-ral 2353 df-rex 2354 df-rab 2357 df-v 2603 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-pw 3384 df-sn 3404 df-pr 3405 df-uni 3602 df-int 3637 df-tr 3876 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 |
This theorem is referenced by: phplem2 6339 |
Copyright terms: Public domain | W3C validator |