| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > parhomeqor2 | Structured version Visualization version GIF version | ||
| Description: Variant of parhomeqor 50850. (Contributed by Zhi Wang, 14-Sep-2026.) (Revised by Zhi Wang, 17-Sep-2026.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| parhomval.h | ⊢ 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅))) |
| parhomeqor.f | ⊢ (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉)) |
| parhomeqor.g | ⊢ (𝜑 → 𝐺 ∈ (𝑉𝐻𝑊)) |
| parhomeqor2.s | ⊢ 𝑆 ∈ V |
| parhomeqor2.j | ⊢ 𝐽 ∈ V |
| parhomeqor2.n | ⊢ 𝑋 ≠ 𝑌 |
| parhomeqor2.u | ⊢ (𝜑 → 𝑈 ∈ 𝐵) |
| parhomeqor2.v | ⊢ (𝜑 → 𝑉 ∈ 𝐵) |
| parhomeqor2.w | ⊢ (𝜑 → 𝑊 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| parhomeqor2 | ⊢ (𝜑 → (𝑈 = 𝑉 ∨ 𝑉 = 𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | parhomval.h | . . . . . . 7 ⊢ 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅))) | |
| 2 | parhomeqor.g | . . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ (𝑉𝐻𝑊)) | |
| 3 | 2 | ad2antrr 739 | . . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → 𝐺 ∈ (𝑉𝐻𝑊)) |
| 4 | simpr 490 | . . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → ¬ 𝑉 = 𝑊) | |
| 5 | 1, 3, 4 | parhomne 50846 | . . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → (𝑉 = 𝑋 ∧ 𝑊 = 𝑌)) |
| 6 | 5 | simpld 500 | . . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → 𝑉 = 𝑋) |
| 7 | parhomeqor.f | . . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉)) | |
| 8 | 7 | adantr 486 | . . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑈 = 𝑉) → 𝐹 ∈ (𝑈𝐻𝑉)) |
| 9 | simpr 490 | . . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑈 = 𝑉) → ¬ 𝑈 = 𝑉) | |
| 10 | 1, 8, 9 | parhomne 50846 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑈 = 𝑉) → (𝑈 = 𝑋 ∧ 𝑉 = 𝑌)) |
| 11 | 10 | simprd 501 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑈 = 𝑉) → 𝑉 = 𝑌) |
| 12 | 11 | adantr 486 | . . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → 𝑉 = 𝑌) |
| 13 | 6, 12 | eqtr3d 2797 | . . . 4 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → 𝑋 = 𝑌) |
| 14 | parhomeqor2.n | . . . . . 6 ⊢ 𝑋 ≠ 𝑌 | |
| 15 | 14 | neii 2957 | . . . . 5 ⊢ ¬ 𝑋 = 𝑌 |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (((𝜑 ∧ ¬ 𝑈 = 𝑉) ∧ ¬ 𝑉 = 𝑊) → ¬ 𝑋 = 𝑌) |
| 17 | 13, 16 | condan 830 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑈 = 𝑉) → 𝑉 = 𝑊) |
| 18 | 17 | ex 418 | . 2 ⊢ (𝜑 → (¬ 𝑈 = 𝑉 → 𝑉 = 𝑊)) |
| 19 | 18 | orrd 877 | 1 ⊢ (𝜑 → (𝑈 = 𝑉 ∨ 𝑉 = 𝑊)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 Vcvv 3450 ∅c0 4278 ifcif 4481 {csn 4583 (class class class)co 7420 ∈ cmpo 7422 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-xp 5656 df-dm 5660 df-iota 6494 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |