MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  supeq2 Structured version   Visualization version   GIF version

Theorem supeq2 8560
Description: Equality theorem for supremum. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
supeq2 (𝐵 = 𝐶 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐶, 𝑅))

Proof of Theorem supeq2
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rabeq 3340 . . . 4 (𝐵 = 𝐶 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐶 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))})
2 raleq 3285 . . . . . 6 (𝐵 = 𝐶 → (∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ ∀𝑦𝐶 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧)))
32anbi2d 622 . . . . 5 (𝐵 = 𝐶 → ((∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧)) ↔ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐶 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))))
43rabbidv 3337 . . . 4 (𝐵 = 𝐶 → {𝑥𝐶 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐶 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐶 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))})
51, 4eqtrd 2798 . . 3 (𝐵 = 𝐶 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐶 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐶 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))})
65unieqd 4603 . 2 (𝐵 = 𝐶 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐶 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐶 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))})
7 df-sup 8554 . 2 sup(𝐴, 𝐵, 𝑅) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))}
8 df-sup 8554 . 2 sup(𝐴, 𝐶, 𝑅) = {𝑥𝐶 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐶 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))}
96, 7, 83eqtr4g 2823 1 (𝐵 = 𝐶 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐶, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1652  wral 3054  wrex 3055  {crab 3058   cuni 4593   class class class wbr 4808  supcsup 8552
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2069  ax-7 2105  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-ext 2742
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2062  df-clab 2751  df-cleq 2757  df-clel 2760  df-nfc 2895  df-ral 3059  df-rex 3060  df-rab 3063  df-uni 4594  df-sup 8554
This theorem is referenced by:  infeq2  8591
  Copyright terms: Public domain W3C validator