Theorem dmdbr 32812

Description: Binary relation expressing the dual modular pair property. (Contributed by NM, 27-Apr-2006.) (New usage is discouraged.)

Assertion

Ref	Expression
dmdbr	⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ* 𝐵 ↔ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dmdbr

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2848	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ Cℋ ↔ 𝐴 ∈ Cℋ ))
2	1	anbi1d 643	. . . 4 ⊢ (𝑦 = 𝐴 → ((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ )))
3		ineq2 4160	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑥 ∩ 𝑦) = (𝑥 ∩ 𝐴))
4	3	oveq1d 7431	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = ((𝑥 ∩ 𝐴) ∨ℋ 𝑧))
5		oveq1 7423	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑦 ∨ℋ 𝑧) = (𝐴 ∨ℋ 𝑧))
6	5	ineq2d 4166	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑥 ∩ (𝑦 ∨ℋ 𝑧)) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))
7	4, 6	eqeq12d 2776	. . . . . 6 ⊢ (𝑦 = 𝐴 → (((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧)) ↔ ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))))
8	7	imbi2d 343	. . . . 5 ⊢ (𝑦 = 𝐴 → ((𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧))) ↔ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))))
9	8	ralbidv 3185	. . . 4 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧))) ↔ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))))
10	2, 9	anbi12d 644	. . 3 ⊢ (𝑦 = 𝐴 → (((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧)))) ↔ ((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))))))
11		eleq1 2848	. . . . 5 ⊢ (𝑧 = 𝐵 → (𝑧 ∈ Cℋ ↔ 𝐵 ∈ Cℋ ))
12	11	anbi2d 642	. . . 4 ⊢ (𝑧 = 𝐵 → ((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ )))
13		sseq1 3956	. . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧 ⊆ 𝑥 ↔ 𝐵 ⊆ 𝑥))
14		oveq2 7424	. . . . . . 7 ⊢ (𝑧 = 𝐵 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = ((𝑥 ∩ 𝐴) ∨ℋ 𝐵))
15		oveq2 7424	. . . . . . . 8 ⊢ (𝑧 = 𝐵 → (𝐴 ∨ℋ 𝑧) = (𝐴 ∨ℋ 𝐵))
16	15	ineq2d 4166	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (𝑥 ∩ (𝐴 ∨ℋ 𝑧)) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))
17	14, 16	eqeq12d 2776	. . . . . 6 ⊢ (𝑧 = 𝐵 → (((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)) ↔ ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵))))
18	13, 17	imbi12d 347	. . . . 5 ⊢ (𝑧 = 𝐵 → ((𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))) ↔ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))
19	18	ralbidv 3185	. . . 4 ⊢ (𝑧 = 𝐵 → (∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))) ↔ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))
20	12, 19	anbi12d 644	. . 3 ⊢ (𝑧 = 𝐵 → (((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))) ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵))))))
21		df-dmd 32794	. . 3 ⊢ 𝑀ℋ* = {⟨𝑦, 𝑧⟩ ∣ ((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧))))}
22	10, 20, 21	brabg 5518	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ* 𝐵 ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵))))))
23	22	bianabs 551	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ* 𝐵 ↔ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ∩ cin 3898   ⊆ wss 3899   class class class wbr 5103  (class class class)co 7416   C_ℋ cch 31442   ∨_ℋ chj 31446   𝑀_ℋ^* cdmd 31480

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-iota 6491  df-fv 6543  df-ov 7419  df-dmd 32794

This theorem is used by:  dmdmd  32813  dmdi  32815  dmdbr2  32816  dmdbr3  32818  mddmd2  32822