Theorem mdbr3 30659

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 30656	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 ↔ ∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)))))
2		chincl 29861	. . . . . . . 8 ⊢ ((𝑥 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝑥 ∩ 𝐵) ∈ Cℋ )
3		inss2 4163	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝐵) ⊆ 𝐵
4		sseq1 3946	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝑦 ⊆ 𝐵 ↔ (𝑥 ∩ 𝐵) ⊆ 𝐵))
5		oveq1 7282	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝑦 ∨ℋ 𝐴) = ((𝑥 ∩ 𝐵) ∨ℋ 𝐴))
6	5	ineq1d 4145	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵))
7		oveq1 7282	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (𝑦 ∨ℋ (𝐴 ∩ 𝐵)) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))
8	6, 7	eqeq12d 2754	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → (((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)) ↔ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
9	4, 8	imbi12d 345	. . . . . . . . . 10 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ((𝑥 ∩ 𝐵) ⊆ 𝐵 → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
10	9	rspcv 3557	. . . . . . . . 9 ⊢ ((𝑥 ∩ 𝐵) ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → ((𝑥 ∩ 𝐵) ⊆ 𝐵 → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
11	3, 10	mpii 46	. . . . . . . 8 ⊢ ((𝑥 ∩ 𝐵) ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
12	2, 11	syl 17	. . . . . . 7 ⊢ ((𝑥 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
13	12	ex 413	. . . . . 6 ⊢ (𝑥 ∈ Cℋ → (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
14	13	com3l 89	. . . . 5 ⊢ (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → (𝑥 ∈ Cℋ → (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))))
15	14	ralrimdv 3105	. . . 4 ⊢ (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) → ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
16		dfss 3905	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝐵 ↔ 𝑥 = (𝑥 ∩ 𝐵))
17	16	biimpi 215	. . . . . . . . . 10 ⊢ (𝑥 ⊆ 𝐵 → 𝑥 = (𝑥 ∩ 𝐵))
18	17	oveq1d 7290	. . . . . . . . 9 ⊢ (𝑥 ⊆ 𝐵 → (𝑥 ∨ℋ 𝐴) = ((𝑥 ∩ 𝐵) ∨ℋ 𝐴))
19	18	ineq1d 4145	. . . . . . . 8 ⊢ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵))
20	17	oveq1d 7290	. . . . . . . 8 ⊢ (𝑥 ⊆ 𝐵 → (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)))
21	19, 20	eqeq12d 2754	. . . . . . 7 ⊢ (𝑥 ⊆ 𝐵 → (((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) ↔ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
22	21	biimprcd 249	. . . . . 6 ⊢ ((((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)) → (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))))
23	22	ralimi 3087	. . . . 5 ⊢ (∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)) → ∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))))
24		sseq1 3946	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐵 ↔ 𝑦 ⊆ 𝐵))
25		oveq1 7282	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑥 ∨ℋ 𝐴) = (𝑦 ∨ℋ 𝐴))
26	25	ineq1d 4145	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = ((𝑦 ∨ℋ 𝐴) ∩ 𝐵))
27		oveq1 7282	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)))
28	26, 27	eqeq12d 2754	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) ↔ ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))))
29	24, 28	imbi12d 345	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) ↔ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵)))))
30	29	cbvralvw 3383	. . . . 5 ⊢ (∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))))
31	23, 30	sylib 217	. . . 4 ⊢ (∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵)) → ∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))))
32	15, 31	impbid1 224	. . 3 ⊢ (𝐵 ∈ Cℋ → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
33	32	adantl 482	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (∀𝑦 ∈ Cℋ (𝑦 ⊆ 𝐵 → ((𝑦 ∨ℋ 𝐴) ∩ 𝐵) = (𝑦 ∨ℋ (𝐴 ∩ 𝐵))) ↔ ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))
34	1, 33	bitrd 278	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 ↔ ∀𝑥 ∈ Cℋ (((𝑥 ∩ 𝐵) ∨ℋ 𝐴) ∩ 𝐵) = ((𝑥 ∩ 𝐵) ∨ℋ (𝐴 ∩ 𝐵))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064   ∩ cin 3886   ⊆ wss 3887   class class class wbr 5074  (class class class)co 7275   C_ℋ cch 29291   ∨_ℋ chj 29295   𝑀_ℋ cmd 29328

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-1cn 10929  ax-addcl 10931  ax-hilex 29361  ax-hfvadd 29362  ax-hv0cl 29365  ax-hfvmul 29367

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-map 8617  df-nn 11974  df-hlim 29334  df-sh 29569  df-ch 29583  df-md 30642

This theorem is referenced by: (None)