Theorem gcdcllem2 16596

Description: Lemma for gcdn0cl 16598, gcddvds 16599 and dvdslegcd 16600. (Contributed by Paul Chapman, 21-Mar-2011.)

Hypotheses

Ref	Expression
gcdcllem2.1	⊢ 𝑆 = {𝑧 ∈ ℤ ∣ ∀𝑛 ∈ {𝑀, 𝑁}𝑧 ∥ 𝑛}
gcdcllem2.2	⊢ 𝑅 = {𝑧 ∈ ℤ ∣ (𝑧 ∥ 𝑀 ∧ 𝑧 ∥ 𝑁)}

Assertion

Ref	Expression
gcdcllem2	⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑅 = 𝑆)

Distinct variable groups:   𝑧,𝑛,𝑀   𝑛,𝑁,𝑧

Allowed substitution hints:   𝑅(𝑧, 𝑛)   𝑆(𝑧, 𝑛)

Proof of Theorem gcdcllem2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 5110	. . . . 5 ⊢ (𝑧 = 𝑥 → (𝑧 ∥ 𝑀 ↔ 𝑥 ∥ 𝑀))
2		breq1 5110	. . . . 5 ⊢ (𝑧 = 𝑥 → (𝑧 ∥ 𝑁 ↔ 𝑥 ∥ 𝑁))
3	1, 2	anbi12d 644	. . . 4 ⊢ (𝑧 = 𝑥 → ((𝑧 ∥ 𝑀 ∧ 𝑧 ∥ 𝑁) ↔ (𝑥 ∥ 𝑀 ∧ 𝑥 ∥ 𝑁)))
4		gcdcllem2.2	. . . 4 ⊢ 𝑅 = {𝑧 ∈ ℤ ∣ (𝑧 ∥ 𝑀 ∧ 𝑧 ∥ 𝑁)}
5	3, 4	elrab2 3652	. . 3 ⊢ (𝑥 ∈ 𝑅 ↔ (𝑥 ∈ ℤ ∧ (𝑥 ∥ 𝑀 ∧ 𝑥 ∥ 𝑁)))
6		breq1 5110	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑧 ∥ 𝑛 ↔ 𝑥 ∥ 𝑛))
7	6	ralbidv 3187	. . . . 5 ⊢ (𝑧 = 𝑥 → (∀𝑛 ∈ {𝑀, 𝑁}𝑧 ∥ 𝑛 ↔ ∀𝑛 ∈ {𝑀, 𝑁}𝑥 ∥ 𝑛))
8		gcdcllem2.1	. . . . 5 ⊢ 𝑆 = {𝑧 ∈ ℤ ∣ ∀𝑛 ∈ {𝑀, 𝑁}𝑧 ∥ 𝑛}
9	7, 8	elrab2 3652	. . . 4 ⊢ (𝑥 ∈ 𝑆 ↔ (𝑥 ∈ ℤ ∧ ∀𝑛 ∈ {𝑀, 𝑁}𝑥 ∥ 𝑛))
10		breq2 5111	. . . . . 6 ⊢ (𝑛 = 𝑀 → (𝑥 ∥ 𝑛 ↔ 𝑥 ∥ 𝑀))
11		breq2 5111	. . . . . 6 ⊢ (𝑛 = 𝑁 → (𝑥 ∥ 𝑛 ↔ 𝑥 ∥ 𝑁))
12	10, 11	ralprg 4660	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∀𝑛 ∈ {𝑀, 𝑁}𝑥 ∥ 𝑛 ↔ (𝑥 ∥ 𝑀 ∧ 𝑥 ∥ 𝑁)))
13	12	anbi2d 642	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑥 ∈ ℤ ∧ ∀𝑛 ∈ {𝑀, 𝑁}𝑥 ∥ 𝑛) ↔ (𝑥 ∈ ℤ ∧ (𝑥 ∥ 𝑀 ∧ 𝑥 ∥ 𝑁))))
14	9, 13	bitrid 286	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑥 ∈ 𝑆 ↔ (𝑥 ∈ ℤ ∧ (𝑥 ∥ 𝑀 ∧ 𝑥 ∥ 𝑁))))
15	5, 14	bitr4id 293	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑥 ∈ 𝑅 ↔ 𝑥 ∈ 𝑆))
16	15	eqrdv 2760	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑅 = 𝑆)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  {crab 3414  {cpr 4589   class class class wbr 5107  ℤcz 12619   ∥ cdvds 16348

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 2734

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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108

This theorem is used by:  gcdcllem3  16597