| 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 9198 expressed without negation. (Contributed by Rohan Ridenour, 3-Aug-2023.) Avoid ax-pow 5338. (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 2775 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐵 = 𝐴) |
| 7 | dfpss2 4043 | . . . . . 6 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐵 = 𝐴)) | |
| 8 | 4, 6, 7 | sylanbrc 595 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ⊊ 𝐴) |
| 9 | php3 9200 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴) | |
| 10 | 2, 8, 9 | syl2an2r 698 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ≺ 𝐴) |
| 11 | sdomnen 8984 | . . . . 5 ⊢ (𝐵 ≺ 𝐴 → ¬ 𝐵 ≈ 𝐴) | |
| 12 | ensymfib 9175 | . . . . . . 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 1570 ∈ wcel 2146 ⊆ wss 3906 ⊊ wpss 3907 class class class wbr 5111 ≈ cen 8946 ≺ csdm 8948 Fincfn 8949 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-om 7869 df-1o 8459 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 |
| This theorem is used by: phphashd 14523 simpgnsgd 20218 |
| Copyright terms: Public domain | W3C validator |