![]() |
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 4645 | . . 3 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
2 | nordeq 4577 | . . . 4 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐴 ≠ 𝐵) | |
3 | disjsn2 3682 | . . . 4 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
4 | 2, 3 | syl 14 | . . 3 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∩ {𝐵}) = ∅) |
5 | 1, 4 | sylan 283 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∩ {𝐵}) = ∅) |
6 | undif4 3510 | . . 3 ⊢ (({𝐴} ∩ {𝐵}) = ∅ → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (({𝐴} ∪ 𝐴) ∖ {𝐵})) | |
7 | df-suc 4403 | . . . . 5 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
8 | 7 | equncomi 3306 | . . . 4 ⊢ suc 𝐴 = ({𝐴} ∪ 𝐴) |
9 | 8 | difeq1i 3274 | . . 3 ⊢ (suc 𝐴 ∖ {𝐵}) = (({𝐴} ∪ 𝐴) ∖ {𝐵}) |
10 | 6, 9 | eqtr4di 2244 | . 2 ⊢ (({𝐴} ∩ {𝐵}) = ∅ → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
11 | 5, 10 | syl 14 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ≠ wne 2364 ∖ cdif 3151 ∪ cun 3152 ∩ cin 3153 ∅c0 3447 {csn 3619 Ord word 4394 suc csuc 4397 ωcom 4623 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-uni 3837 df-int 3872 df-tr 4129 df-iord 4398 df-on 4400 df-suc 4403 df-iom 4624 |
This theorem is referenced by: phplem2 6911 |
Copyright terms: Public domain | W3C validator |