| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > phpeqd | Structured version Visualization version GIF version | ||
| Description: Corollary of the Pigeonhole Principle using equality. Strengthening of php 9233 expressed without negation. (Contributed by Rohan Ridenour, 3-Aug-2023.) Avoid ax-pow 5330. (Revised by BTernaryTau, 28-Nov-2024.) |
| Ref | Expression |
|---|---|
| phpeqd.1 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| phpeqd.2 | ⊢ (𝜑 → 𝐵 ⊆ 𝐴) |
| phpeqd.3 | ⊢ (𝜑 → 𝐴 ≈ 𝐵) |
| Ref | Expression |
|---|---|
| phpeqd | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | phpeqd.3 | . 2 ⊢ (𝜑 → 𝐴 ≈ 𝐵) | |
| 2 | phpeqd.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 3 | phpeqd.2 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝐴) | |
| 4 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ⊆ 𝐴) |
| 5 | simpr 490 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐴 = 𝐵) | |
| 6 | 5 | neqcomd 2773 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐵 = 𝐴) |
| 7 | dfpss2 4017 | . . . . . 6 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐵 = 𝐴)) | |
| 8 | 4, 6, 7 | sylanbrc 595 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ⊊ 𝐴) |
| 9 | php3 9235 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
| 10 | 2, 8, 9 | syl2an2r 698 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ≺ 𝐴) |
| 11 | sdomnen 9019 | . . . . 5 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐵 ≈ 𝐴) | |
| 12 | ensymfib 9210 | . . . . . . 7 ⊢ (𝐴 ∈ Fin → (𝐴 ≈ 𝐵 ↔ 𝐵 ≈ 𝐴)) | |
| 13 | 12 | notbid 321 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (¬ 𝐴 ≈ 𝐵 ↔ ¬ 𝐵 ≈ 𝐴)) |
| 14 | 13 | biimpar 483 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ ¬ 𝐵 ≈ 𝐴) → ¬ 𝐴 ≈ 𝐵) |
| 15 | 2, 11, 14 | syl2an 608 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≺ 𝐴) → ¬ 𝐴 ≈ 𝐵) |
| 16 | 10, 15 | syldan 603 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐴 ≈ 𝐵) |
| 17 | 16 | ex 418 | . 2 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → ¬ 𝐴 ≈ 𝐵)) |
| 18 | 1, 17 | mt4d 118 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ⊆ wss 3899 ⊊ wpss 4015 class class class wbr 5105 ≈ cen 8981 ≺ csdm 8983 Fincfn 8984 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pr 5394 ax-un 7758 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-om 7885 df-1o 8487 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 |
| This theorem is used by: phphashd 14621 simpgnsgd 20328 |
| Copyright terms: Public domain | W3C validator |