Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  parhomne Structured version   Visualization version   GIF version

Theorem parhomne 50960
Description: A morphism between different objects has the distinguished source and target. (Contributed by Zhi Wang, 14-Sep-2026.) (Revised by Zhi Wang, 17-Sep-2026.)
Hypotheses
Ref Expression
parhomval.h 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅)))
parhomne.f (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉))
parhomne.n (𝜑 → ¬ 𝑈 = 𝑉)
Assertion
Ref Expression
parhomne (𝜑 → (𝑈 = 𝑋 ∧ 𝑉 = 𝑌))
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐽,𝑦   𝑥,𝑆,𝑦   𝑥,𝑈,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝑥,𝑉,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐻(𝑥, 𝑦)

Proof of Theorem parhomne
StepHypRef Expression
1 parhomne.f . . . 4 (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉))
2 parhomval.h . . . . . . 7 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅)))
32parhomvaln0 50958 . . . . . 6 (𝐹 ∈ (𝑈𝐻𝑉) → (𝑈𝐻𝑉) = if(𝑈 = 𝑉, {𝐽}, if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅)))
41, 3syl 18 . . . . 5 (𝜑 → (𝑈𝐻𝑉) = if(𝑈 = 𝑉, {𝐽}, if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅)))
5 parhomne.n . . . . . 6 (𝜑 → ¬ 𝑈 = 𝑉)
65iffalsed 4496 . . . . 5 (𝜑 → if(𝑈 = 𝑉, {𝐽}, if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅)) = if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅))
74, 6eqtrd 2798 . . . 4 (𝜑 → (𝑈𝐻𝑉) = if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅))
81, 7eleqtrd 2866 . . 3 (𝜑 → 𝐹 ∈ if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅))
9 elif0 50127 . . 3 (𝐹 ∈ if((𝑈 = 𝑋 ∧ 𝑉 = 𝑌), 𝑆, ∅) ↔ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆))
108, 9sylib 221 . 2 (𝜑 → ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆))
1110simpld 500 1 (𝜑 → (𝑈 = 𝑋 ∧ 𝑉 = 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∅c0 4281  ifcif 4485  {csn 4588  (class class class)co 7443   ∈ cmpo 7445
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-xp 5661  df-dm 5665  df-iota 6512  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448
This theorem is used by:  parhomeqor2  50963  parhomeqor  50964
  Copyright terms: Public domain W3C validator