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

Theorem parhomne2 50959
Description: Variant of parhomne 50960. (Contributed by Zhi Wang, 14-Sep-2026.) (Revised by Zhi Wang, 17-Sep-2026.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
parhomval.h 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅)))
parhomne.f (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉))
parhomne.n (𝜑 → ¬ 𝑈 = 𝑉)
parhomne2.s 𝑆 ∈ V
parhomne2.j 𝐽 ∈ V
parhomne2.u (𝜑 → 𝑈 ∈ 𝐵)
parhomne2.v (𝜑 → 𝑉 ∈ 𝐵)
Assertion
Ref Expression
parhomne2 (𝜑 → (𝑈 = 𝑋 ∧ 𝑉 = 𝑌))
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐽,𝑦   𝑥,𝑆,𝑦   𝑥,𝑈,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝑥,𝑉,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐻(𝑥, 𝑦)

Proof of Theorem parhomne2
StepHypRef Expression
1 parhomne.f . . . 4 (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉))
2 parhomne2.u . . . . 5 (𝜑 → 𝑈 ∈ 𝐵)
3 parhomne2.v . . . . 5 (𝜑 → 𝑉 ∈ 𝐵)
4 parhomval.h . . . . . 6 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅)))
5 parhomne2.s . . . . . 6 𝑆 ∈ V
6 parhomne2.j . . . . . 6 𝐽 ∈ V
74, 5, 6parhomel 50949 . . . . 5 ((𝑈 ∈ 𝐵 ∧ 𝑉 ∈ 𝐵) → (𝐹 ∈ (𝑈𝐻𝑉) ↔ ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)))))
82, 3, 7syl2anc 596 . . . 4 (𝜑 → (𝐹 ∈ (𝑈𝐻𝑉) ↔ ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)))))
91, 8mpbid 235 . . 3 (𝜑 → ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆))))
10 parhomne.n . . . 4 (𝜑 → ¬ 𝑈 = 𝑉)
1110intnanrd 495 . . 3 (𝜑 → ¬ (𝑈 = 𝑉 ∧ 𝐹 = 𝐽))
129, 11orcnd 892 . 2 (𝜑 → (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)))
1312simprld 784 1 (𝜑 → (𝑈 = 𝑋 ∧ 𝑉 = 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator