![]() |
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 8036 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴) | |
2 | breq2 4009 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 < 𝐴 ↔ 𝐴 < 𝐵)) | |
3 | 2 | notbid 667 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 < 𝐴 ↔ ¬ 𝐴 < 𝐵)) |
4 | 1, 3 | syl5ibcom 155 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 = 𝐵 → ¬ 𝐴 < 𝐵)) |
5 | breq1 4008 | . . . . . 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 8030 | . . . 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 4005 ℝcr 7812 < clt 7994 |
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 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-pre-ltirr 7925 ax-pre-apti 7928 |
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 2741 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-xp 4634 df-pnf 7996 df-mnf 7997 df-ltxr 7999 |
This theorem is referenced by: letri3 8040 lttri3i 8057 lttri3d 8074 inelr 8543 lbinf 8907 suprubex 8910 suprlubex 8911 suprleubex 8913 sup3exmid 8916 suprzclex 9353 infrenegsupex 9596 supminfex 9599 infregelbex 9600 xrlttri3 9799 maxleim 11216 maxabs 11220 maxleast 11224 zsupcl 11950 zssinfcl 11951 infssuzledc 11953 suprzcl2dc 11958 dvdslegcd 11967 bezoutlemsup 12012 dfgcd2 12017 lcmgcdlem 12079 suplociccex 14188 pilem3 14289 taupi 14906 |
Copyright terms: Public domain | W3C validator |