![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > infnlbti | GIF version |
Description: A lower bound is not greater than the infimum. (Contributed by Jim Kingdon, 18-Dec-2021.) |
Ref | Expression |
---|---|
infclti.ti | ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢))) |
infclti.ex | ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))) |
Ref | Expression |
---|---|
infnlbti | ⊢ (𝜑 → ((𝐶 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐵 ¬ 𝑧𝑅𝐶) → ¬ inf(𝐵, 𝐴, 𝑅)𝑅𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | infclti.ti | . . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴)) → (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢))) | |
2 | infclti.ex | . . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝑦))) | |
3 | 1, 2 | infglbti 7023 | . . . . 5 ⊢ (𝜑 → ((𝐶 ∈ 𝐴 ∧ inf(𝐵, 𝐴, 𝑅)𝑅𝐶) → ∃𝑧 ∈ 𝐵 𝑧𝑅𝐶)) |
4 | 3 | expdimp 259 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → (inf(𝐵, 𝐴, 𝑅)𝑅𝐶 → ∃𝑧 ∈ 𝐵 𝑧𝑅𝐶)) |
5 | rexalim 2470 | . . . 4 ⊢ (∃𝑧 ∈ 𝐵 𝑧𝑅𝐶 → ¬ ∀𝑧 ∈ 𝐵 ¬ 𝑧𝑅𝐶) | |
6 | 4, 5 | syl6 33 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → (inf(𝐵, 𝐴, 𝑅)𝑅𝐶 → ¬ ∀𝑧 ∈ 𝐵 ¬ 𝑧𝑅𝐶)) |
7 | 6 | con2d 624 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐴) → (∀𝑧 ∈ 𝐵 ¬ 𝑧𝑅𝐶 → ¬ inf(𝐵, 𝐴, 𝑅)𝑅𝐶)) |
8 | 7 | expimpd 363 | 1 ⊢ (𝜑 → ((𝐶 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐵 ¬ 𝑧𝑅𝐶) → ¬ inf(𝐵, 𝐴, 𝑅)𝑅𝐶)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2148 ∀wral 2455 ∃wrex 2456 class class class wbr 4003 infcinf 6981 |
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-14 2151 ax-ext 2159 ax-sep 4121 ax-pow 4174 ax-pr 4209 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-br 4004 df-opab 4065 df-cnv 4634 df-iota 5178 df-riota 5830 df-sup 6982 df-inf 6983 |
This theorem is referenced by: infregelbex 9597 |
Copyright terms: Public domain | W3C validator |