Theorem supeq1 7109

Description: Equality theorem for supremum. (Contributed by NM, 22-May-1999.)

Assertion

Ref	Expression
supeq1	⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅))

Proof of Theorem supeq1

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

Step	Hyp	Ref	Expression
1		raleq 2703	. . . . 5 ⊢ (𝐵 = 𝐶 → (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ 𝐶 ¬ 𝑥𝑅𝑦))
2		rexeq 2704	. . . . . . 7 ⊢ (𝐵 = 𝐶 → (∃𝑧 ∈ 𝐵 𝑦𝑅𝑧 ↔ ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧))
3	2	imbi2d 230	. . . . . 6 ⊢ (𝐵 = 𝐶 → ((𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧)))
4	3	ralbidv 2507	. . . . 5 ⊢ (𝐵 = 𝐶 → (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧)))
5	1, 4	anbi12d 473	. . . 4 ⊢ (𝐵 = 𝐶 → ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ↔ (∀𝑦 ∈ 𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧))))
6	5	rabbidv 2762	. . 3 ⊢ (𝐵 = 𝐶 → {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧))})
7	6	unieqd 3870	. 2 ⊢ (𝐵 = 𝐶 → ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧))})
8		df-sup 7107	. 2 ⊢ sup(𝐵, 𝐴, 𝑅) = ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))}
9		df-sup 7107	. 2 ⊢ sup(𝐶, 𝐴, 𝑅) = ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐶 𝑦𝑅𝑧))}
10	7, 8, 9	3eqtr4g 2264	1 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1373  ∀wral 2485  ∃wrex 2486  {crab 2489  ∪ cuni 3859   class class class wbr 4054  supcsup 7105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-rab 2494  df-uni 3860  df-sup 7107

This theorem is referenced by:  supeq1d  7110  supeq1i  7111  infeq1  7134