ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  supeq3 GIF version

Theorem supeq3 6983
Description: Equality theorem for supremum. (Contributed by Scott Fenton, 13-Jun-2018.)
Assertion
Ref Expression
supeq3 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))

Proof of Theorem supeq3
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq 4002 . . . . . . 7 (𝑅 = 𝑆 → (𝑥𝑅𝑦𝑥𝑆𝑦))
21notbid 667 . . . . . 6 (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑆𝑦))
32ralbidv 2477 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦𝐴 ¬ 𝑥𝑆𝑦))
4 breq 4002 . . . . . . 7 (𝑅 = 𝑆 → (𝑦𝑅𝑥𝑦𝑆𝑥))
5 breq 4002 . . . . . . . 8 (𝑅 = 𝑆 → (𝑦𝑅𝑧𝑦𝑆𝑧))
65rexbidv 2478 . . . . . . 7 (𝑅 = 𝑆 → (∃𝑧𝐴 𝑦𝑅𝑧 ↔ ∃𝑧𝐴 𝑦𝑆𝑧))
74, 6imbi12d 234 . . . . . 6 (𝑅 = 𝑆 → ((𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
87ralbidv 2477 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
93, 8anbi12d 473 . . . 4 (𝑅 = 𝑆 → ((∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧)) ↔ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))))
109rabbidv 2726 . . 3 (𝑅 = 𝑆 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
1110unieqd 3818 . 2 (𝑅 = 𝑆 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
12 df-sup 6977 . 2 sup(𝐴, 𝐵, 𝑅) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))}
13 df-sup 6977 . 2 sup(𝐴, 𝐵, 𝑆) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))}
1411, 12, 133eqtr4g 2235 1 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1353  wral 2455  wrex 2456  {crab 2459   cuni 3807   class class class wbr 4000  supcsup 6975
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-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-uni 3808  df-br 4001  df-sup 6977
This theorem is referenced by:  infeq3  7008
  Copyright terms: Public domain W3C validator