Metamath Proof Explorer


Theorem parhomco2

Description: Variant of parhomco . (Contributed by Zhi Wang, 14-Sep-2026) (Revised by Zhi Wang, 17-Sep-2026) (New usage is discouraged.) (Proof modification is discouraged.)

Ref Expression
Hypotheses parhomval.h ⊢ H = x ∈ B , y ∈ B ⟼ if x = y J if x = X ∧ y = Y S ∅
parhomeqor.f ⊢ φ → F ∈ U H V
parhomeqor.g ⊢ φ → G ∈ V H W
parhomco.p ⊢ S ⊆ 𝒫 J
parhomco2.s ⊢ S ∈ V
parhomco2.j ⊢ J ∈ V
parhomco2.n ⊢ X ≠ Y
parhomco2.u ⊢ φ → U ∈ B
parhomco2.v ⊢ φ → V ∈ B
parhomco2.w ⊢ φ → W ∈ B
Assertion parhomco2 ⊢ φ → G ∩ F ∈ U H W

Proof

Step Hyp Ref Expression
1 parhomval.h ⊢ H = x ∈ B , y ∈ B ⟼ if x = y J if x = X ∧ y = Y S ∅
2 parhomeqor.f ⊢ φ → F ∈ U H V
3 parhomeqor.g ⊢ φ → G ∈ V H W
4 parhomco.p ⊢ S ⊆ 𝒫 J
5 parhomco2.s ⊢ S ∈ V
6 parhomco2.j ⊢ J ∈ V
7 parhomco2.n ⊢ X ≠ Y
8 parhomco2.u ⊢ φ → U ∈ B
9 parhomco2.v ⊢ φ → V ∈ B
10 parhomco2.w ⊢ φ → W ∈ B
11 3 adantr ⊢ φ ∧ U = V → G ∈ V H W
12 2 adantr ⊢ φ ∧ U = V → F ∈ U H V
13 simpr ⊢ φ ∧ U = V → U = V
14 1 12 13 parhomideq ⊢ φ ∧ U = V → F = J
15 14 ineq2d ⊢ φ ∧ U = V → G ∩ F = G ∩ J
16 1 4 3 parhomss ⊢ φ → G ⊆ J
17 16 adantr ⊢ φ ∧ U = V → G ⊆ J
18 dfss2 ⊢ G ⊆ J ↔ G ∩ J = G
19 17 18 sylib ⊢ φ ∧ U = V → G ∩ J = G
20 15 19 eqtrd ⊢ φ ∧ U = V → G ∩ F = G
21 13 oveq1d ⊢ φ ∧ U = V → U H W = V H W
22 11 20 21 3eltr4d ⊢ φ ∧ U = V → G ∩ F ∈ U H W
23 3 adantr ⊢ φ ∧ V = W → G ∈ V H W
24 simpr ⊢ φ ∧ V = W → V = W
25 1 23 24 parhomideq ⊢ φ ∧ V = W → G = J
26 25 ineq1d ⊢ φ ∧ V = W → G ∩ F = J ∩ F
27 1 4 2 parhomss ⊢ φ → F ⊆ J
28 27 adantr ⊢ φ ∧ V = W → F ⊆ J
29 sseqin2 ⊢ F ⊆ J ↔ J ∩ F = F
30 28 29 sylib ⊢ φ ∧ V = W → J ∩ F = F
31 26 30 eqtrd ⊢ φ ∧ V = W → G ∩ F = F
32 2 adantr ⊢ φ ∧ V = W → F ∈ U H V
33 24 oveq2d ⊢ φ ∧ V = W → U H V = U H W
34 32 33 eleqtrd ⊢ φ ∧ V = W → F ∈ U H W
35 31 34 eqeltrd ⊢ φ ∧ V = W → G ∩ F ∈ U H W
36 1 2 3 parhomeqor ⊢ φ → U = V ∨ V = W
37 22 35 36 mpjaodan ⊢ φ → G ∩ F ∈ U H W