Theorem parhomcl2 50950

Description: Variant of parhomcl 50953. (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((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅)))
parhomval.s	⊢ 𝑆 ∈ V
parhomel.j	⊢ 𝐽 ∈ V
parhomcl2.k	⊢ 𝐾 = (𝑆 ∪ {𝐽})
parhomcl2.u	⊢ (𝜑 → 𝑈 ∈ 𝐵)
parhomcl2.v	⊢ (𝜑 → 𝑉 ∈ 𝐵)
parhomcl2.f	⊢ (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉))

Assertion

Ref	Expression
parhomcl2	⊢ (𝜑 → 𝐹 ∈ 𝐾)

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐽,𝑦   𝑥,𝑆,𝑦   𝑥,𝑈,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦   𝑥,𝑉,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐻(𝑥, 𝑦)   𝐾(𝑥, 𝑦)

Proof of Theorem parhomcl2

Step	Hyp	Ref	Expression
1		parhomcl2.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝑈𝐻𝑉))
2		parhomcl2.u	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝐵)
3		parhomcl2.v	. . . . . 6 ⊢ (𝜑 → 𝑉 ∈ 𝐵)
4		parhomval.h	. . . . . . 7 ⊢ 𝐻 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝑥 = 𝑦, {𝐽}, if((𝑥 = 𝑋 ∧ 𝑦 = 𝑌), 𝑆, ∅)))
5		parhomval.s	. . . . . . 7 ⊢ 𝑆 ∈ V
6		parhomel.j	. . . . . . 7 ⊢ 𝐽 ∈ V
7	4, 5, 6	parhomel 50949	. . . . . 6 ⊢ ((𝑈 ∈ 𝐵 ∧ 𝑉 ∈ 𝐵) → (𝐹 ∈ (𝑈𝐻𝑉) ↔ ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)))))
8	2, 3, 7	syl2anc 596	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝑈𝐻𝑉) ↔ ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)))))
9	1, 8	mpbid 235	. . . 4 ⊢ (𝜑 → ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆))))
10	6	elsn2 4626	. . . . . . 7 ⊢ (𝐹 ∈ {𝐽} ↔ 𝐹 = 𝐽)
11	10	bilanri 512	. . . . . 6 ⊢ ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) → 𝐹 ∈ {𝐽})
12	11	olcd 888	. . . . 5 ⊢ ((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) → (𝐹 ∈ 𝑆 ∨ 𝐹 ∈ {𝐽}))
13		simprr 785	. . . . . 6 ⊢ ((¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)) → 𝐹 ∈ 𝑆)
14	13	orcd 887	. . . . 5 ⊢ ((¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆)) → (𝐹 ∈ 𝑆 ∨ 𝐹 ∈ {𝐽}))
15	12, 14	jaoi 871	. . . 4 ⊢ (((𝑈 = 𝑉 ∧ 𝐹 = 𝐽) ∨ (¬ 𝑈 = 𝑉 ∧ ((𝑈 = 𝑋 ∧ 𝑉 = 𝑌) ∧ 𝐹 ∈ 𝑆))) → (𝐹 ∈ 𝑆 ∨ 𝐹 ∈ {𝐽}))
16	9, 15	syl 18	. . 3 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ∨ 𝐹 ∈ {𝐽}))
17		elun 4155	. . 3 ⊢ (𝐹 ∈ (𝑆 ∪ {𝐽}) ↔ (𝐹 ∈ 𝑆 ∨ 𝐹 ∈ {𝐽}))
18	16, 17	sylibr 237	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑆 ∪ {𝐽}))
19		parhomcl2.k	. 2 ⊢ 𝐾 = (𝑆 ∪ {𝐽})
20	18, 19	eleqtrrdi 2875	1 ⊢ (𝜑 → 𝐹 ∈ 𝐾)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  ∅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)