Theorem mdbr3 32456

Description: Binary relation expressing the modular pair property. This version quantifies an equality instead of an inference. (Contributed by NM, 6-Jul-2004.) (New usage is discouraged.)

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem mdbr3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mdbr 32453	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 ↔ ∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)))))
2		chincl 31658	. . . . . . . 8 ⊢ ((𝑥 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝑥 ∩ 𝐵) ∈ Cℋ )
3		inss2 4187	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝐵) ⊆ 𝐵
4		sseq1 3959	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝑦 ⊆ 𝐵 ↔ (𝑥 ∩ 𝐵) ⊆ 𝐵))
5		oveq1 7397	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝑦 ∨ℋ 𝐴) = ((𝑥 ∩ 𝐵) ∨ℋ 𝐴))
6	5	ineq1d 4169	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵))
7		oveq1 7397	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝑦 ∨ℋ (𝐴 ∩ 𝐵)) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))
8	6, 7	eqeq12d 2777	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)) ↔ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
9	4, 8	imbi12d 346	. . . . . . . . . 10 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ((𝑥 ∩ 𝐵) ⊆ 𝐵 → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
10	9	rspcv 3576	. . . . . . . . 9 ⊢ ((𝑥 ∩ 𝐵) ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → ((𝑥 ∩ 𝐵) ⊆ 𝐵 → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
11	3, 10	mpii 46	. . . . . . . 8 ⊢ ((𝑥 ∩ 𝐵) ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
12	2, 11	syl 17	. . . . . . 7 ⊢ ((𝑥 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
13	12	ex 416	. . . . . 6 ⊢ (𝑥 ∈ Cℋ → (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
14	13	com3l 89	. . . . 5 ⊢ (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (𝑥 ∈ Cℋ → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
15	14	ralrimdv 3159	. . . 4 ⊢ (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
16		dfss 3921	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝐵 ↔ 𝑥 = (𝑥 ∩ 𝐵))
17	16	biimpi 218	. . . . . . . . . 10 ⊢ (𝑥 ⊆ 𝐵 → 𝑥 = (𝑥 ∩ 𝐵))
18	17	oveq1d 7405	. . . . . . . . 9 ⊢ (𝑥 ⊆ 𝐵 → (𝑥 ∨ℋ 𝐴) = ((𝑥 ∩ 𝐵) ∨ℋ 𝐴))
19	18	ineq1d 4169	. . . . . . . 8 ⊢ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵))
20	17	oveq1d 7405	. . . . . . . 8 ⊢ (𝑥 ⊆ 𝐵 → (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))
21	19, 20	eqeq12d 2777	. . . . . . 7 ⊢ (𝑥 ⊆ 𝐵 → (((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) ↔ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
22	21	biimprcd 252	. . . . . 6 ⊢ ((((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)) → (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))))
23	22	ralimi 3098	. . . . 5 ⊢ (∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)) → ∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))))
24		sseq1 3959	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐵 ↔ 𝑦 ⊆ 𝐵))
25		oveq1 7397	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ∨ℋ 𝐴) = (𝑦 ∨ℋ 𝐴))
26	25	ineq1d 4169	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = ((𝑦 ∨ℋ 𝐴) ∩ 𝐵))
27		oveq1 7397	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)))
28	26, 27	eqeq12d 2777	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) ↔ ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))))
29	24, 28	imbi12d 346	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) ↔ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)))))
30	29	cbvralvw 3239	. . . . 5 ⊢ (∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))))
31	23, 30	sylib 220	. . . 4 ⊢ (∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)) → ∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))))
32	15, 31	impbid1 227	. . 3 ⊢ (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
33	32	adantl 485	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
34	1, 33	bitrd 281	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 ↔ ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141  ∀wral 3075   ∩ cin 3901   ⊆ wss 3902   class class class wbr 5097  (class class class)co 7390   C_ℋ cch 31088   ∨_ℋ chj 31092   𝑀_ℋ cmd 31125

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712  ax-cnex 11122  ax-1cn 11124  ax-addcl 11126  ax-hilex 31158  ax-hfvadd 31159  ax-hv0cl 31162  ax-hfvmul 31164

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6282  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7841  df-2nd 7965  df-frecs 8255  df-wrecs 8286  df-recs 8335  df-rdg 8374  df-map 8803  df-nn 12204  df-hlim 31131  df-sh 31366  df-ch 31380  df-md 32439

This theorem is referenced by: (None)