Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > infsnti | GIF version |
Description: The infimum of a singleton. (Contributed by Jim Kingdon, 19-Dec-2021.) |
Ref | Expression |
---|---|
infsnti.ti | ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢))) |
infsnti.b | ⊢ (𝜑 → 𝐵 ∈ 𝐴) |
Ref | Expression |
---|---|
infsnti | ⊢ (𝜑 → inf({𝐵}, 𝐴, 𝑅) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-inf 6398 | . 2 ⊢ inf({𝐵}, 𝐴, 𝑅) = sup({𝐵}, 𝐴, ◡𝑅) | |
2 | infsnti.ti | . . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢))) | |
3 | 2 | cnvti 6432 | . . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢◡𝑅𝑣 ∧ ¬ 𝑣◡𝑅𝑢))) |
4 | infsnti.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝐴) | |
5 | 3, 4 | supsnti 6418 | . 2 ⊢ (𝜑 → sup({𝐵}, 𝐴, ◡𝑅) = 𝐵) |
6 | 1, 5 | syl5eq 2125 | 1 ⊢ (𝜑 → inf({𝐵}, 𝐴, 𝑅) = 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1284 ∈ wcel 1433 {csn 3398 class class class wbr 3785 ◡ccnv 4362 supcsup 6395 infcinf 6396 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-reu 2355 df-rmo 2356 df-rab 2357 df-v 2603 df-sbc 2816 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-br 3786 df-opab 3840 df-cnv 4371 df-iota 4887 df-riota 5488 df-sup 6397 df-inf 6398 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |