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 4589 | . . 3 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
2 | nordeq 4521 | . . . 4 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐴 ≠ 𝐵) | |
3 | disjsn2 3639 | . . . 4 ⊢ (𝐴 ≠ 𝐵 → ({𝐴} ∩ {𝐵}) = ∅) | |
4 | 2, 3 | syl 14 | . . 3 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∩ {𝐵}) = ∅) |
5 | 1, 4 | sylan 281 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∩ {𝐵}) = ∅) |
6 | undif4 3471 | . . 3 ⊢ (({𝐴} ∩ {𝐵}) = ∅ → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (({𝐴} ∪ 𝐴) ∖ {𝐵})) | |
7 | df-suc 4349 | . . . . 5 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
8 | 7 | equncomi 3268 | . . . 4 ⊢ suc 𝐴 = ({𝐴} ∪ 𝐴) |
9 | 8 | difeq1i 3236 | . . 3 ⊢ (suc 𝐴 ∖ {𝐵}) = (({𝐴} ∪ 𝐴) ∖ {𝐵}) |
10 | 6, 9 | eqtr4di 2217 | . 2 ⊢ (({𝐴} ∩ {𝐵}) = ∅ → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
11 | 5, 10 | syl 14 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ 𝐴) → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 ≠ wne 2336 ∖ cdif 3113 ∪ cun 3114 ∩ cin 3115 ∅c0 3409 {csn 3576 Ord word 4340 suc csuc 4343 ωcom 4567 |
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 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-nul 4108 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-iinf 4565 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-ral 2449 df-rex 2450 df-rab 2453 df-v 2728 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-pw 3561 df-sn 3582 df-pr 3583 df-uni 3790 df-int 3825 df-tr 4081 df-iord 4344 df-on 4346 df-suc 4349 df-iom 4568 |
This theorem is referenced by: phplem2 6819 |
Copyright terms: Public domain | W3C validator |