![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > lttri3 | GIF version |
Description: Tightness of real apartness. (Contributed by NM, 5-May-1999.) |
Ref | Expression |
---|---|
lttri3 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltnr 8024 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴) | |
2 | breq2 4004 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 < 𝐴 ↔ 𝐴 < 𝐵)) | |
3 | 2 | notbid 667 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 < 𝐴 ↔ ¬ 𝐴 < 𝐵)) |
4 | 1, 3 | syl5ibcom 155 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 = 𝐵 → ¬ 𝐴 < 𝐵)) |
5 | breq1 4003 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 < 𝐴 ↔ 𝐵 < 𝐴)) | |
6 | 5 | notbid 667 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 < 𝐴 ↔ ¬ 𝐵 < 𝐴)) |
7 | 1, 6 | syl5ibcom 155 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 = 𝐵 → ¬ 𝐵 < 𝐴)) |
8 | 4, 7 | jcad 307 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 = 𝐵 → (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
9 | 8 | adantr 276 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 → (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
10 | ioran 752 | . . 3 ⊢ (¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴) ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴)) | |
11 | axapti 8018 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴)) → 𝐴 = 𝐵) | |
12 | 11 | 3expia 1205 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴) → 𝐴 = 𝐵)) |
13 | 10, 12 | biimtrrid 153 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴) → 𝐴 = 𝐵)) |
14 | 9, 13 | impbid 129 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 = wceq 1353 ∈ wcel 2148 class class class wbr 4000 ℝcr 7801 < clt 7982 |
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-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4206 ax-un 4430 ax-setind 4533 ax-cnex 7893 ax-resscn 7894 ax-pre-ltirr 7914 ax-pre-apti 7917 |
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-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2739 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-br 4001 df-opab 4062 df-xp 4629 df-pnf 7984 df-mnf 7985 df-ltxr 7987 |
This theorem is referenced by: letri3 8028 lttri3i 8045 lttri3d 8062 inelr 8531 lbinf 8894 suprubex 8897 suprlubex 8898 suprleubex 8900 sup3exmid 8903 suprzclex 9340 infrenegsupex 9583 supminfex 9586 infregelbex 9587 xrlttri3 9784 maxleim 11198 maxabs 11202 maxleast 11206 zsupcl 11931 zssinfcl 11932 infssuzledc 11934 suprzcl2dc 11939 dvdslegcd 11948 bezoutlemsup 11993 dfgcd2 11998 lcmgcdlem 12060 suplociccex 13770 pilem3 13871 taupi 14474 |
Copyright terms: Public domain | W3C validator |