| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axpre-lttri | Structured version Visualization version GIF version | ||
| Description: Ordering on reals satisfies strict trichotomy. Axiom 18 of 22 for real and complex numbers, derived from ZF set theory. Note: The more general version for extended reals is axlttri 11305. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttri 11198. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 16-Jun-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axpre-lttri | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 <ℝ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elreal 11140 | . 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 2 | elreal 11140 | . 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R 〈𝑦, 0R〉 = 𝐵) | |
| 3 | breq1 5106 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 𝐴 <ℝ 〈𝑦, 0R〉)) | |
| 4 | eqeq1 2764 | . . . . 5 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ 𝐴 = 〈𝑦, 0R〉)) | |
| 5 | breq2 5107 | . . . . 5 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉 ↔ 〈𝑦, 0R〉 <ℝ 𝐴)) | |
| 6 | 4, 5 | orbi12d 932 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((〈𝑥, 0R〉 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ (𝐴 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴))) |
| 7 | 6 | notbid 321 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → (¬ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ ¬ (𝐴 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴))) |
| 8 | 3, 7 | bibi12d 348 | . 2 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ ¬ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉)) ↔ (𝐴 <ℝ 〈𝑦, 0R〉 ↔ ¬ (𝐴 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴)))) |
| 9 | breq2 5107 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 <ℝ 〈𝑦, 0R〉 ↔ 𝐴 <ℝ 𝐵)) | |
| 10 | eqeq2 2772 | . . . . 5 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 = 〈𝑦, 0R〉 ↔ 𝐴 = 𝐵)) | |
| 11 | breq1 5106 | . . . . 5 ⊢ (〈𝑦, 0R〉 = 𝐵 → (〈𝑦, 0R〉 <ℝ 𝐴 ↔ 𝐵 <ℝ 𝐴)) | |
| 12 | 10, 11 | orbi12d 932 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((𝐴 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴) ↔ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
| 13 | 12 | notbid 321 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → (¬ (𝐴 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴) ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
| 14 | 9, 13 | bibi12d 348 | . 2 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((𝐴 <ℝ 〈𝑦, 0R〉 ↔ ¬ (𝐴 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 𝐴)) ↔ (𝐴 <ℝ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴)))) |
| 15 | ltsosr 11103 | . . . 4 ⊢ <R Or R | |
| 16 | sotric 5593 | . . . 4 ⊢ (( <R Or R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → (𝑥 <R 𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥))) | |
| 17 | 15, 16 | mpan 703 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑥 <R 𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥))) |
| 18 | ltresr 11149 | . . 3 ⊢ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 𝑥 <R 𝑦) | |
| 19 | vex 3454 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 20 | 19 | eqresr 11146 | . . . . 5 ⊢ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ 𝑥 = 𝑦) |
| 21 | ltresr 11149 | . . . . 5 ⊢ (〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉 ↔ 𝑦 <R 𝑥) | |
| 22 | 20, 21 | orbi12i 928 | . . . 4 ⊢ ((〈𝑥, 0R〉 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥)) |
| 23 | 22 | notbii 323 | . . 3 ⊢ (¬ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉) ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥)) |
| 24 | 17, 18, 23 | 3bitr4g 317 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ ¬ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ∨ 〈𝑦, 0R〉 <ℝ 〈𝑥, 0R〉))) |
| 25 | 1, 2, 8, 14, 24 | 2gencl 3492 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 <ℝ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 〈cop 4590 class class class wbr 5103 Or wor 5562 Rcnr 10874 0Rc0r 10875 <R cltr 10880 ℝcr 11123 <ℝ cltrr 11128 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-oadd 8459 df-omul 8460 df-er 8696 df-ec 8698 df-qs 8702 df-ni 10881 df-pli 10882 df-mi 10883 df-lti 10884 df-plpq 10917 df-mpq 10918 df-ltpq 10919 df-enq 10920 df-nq 10921 df-erq 10922 df-plq 10923 df-mq 10924 df-1nq 10925 df-rq 10926 df-ltnq 10927 df-np 10990 df-1p 10991 df-plp 10992 df-ltp 10994 df-enr 11064 df-nr 11065 df-ltr 11068 df-0r 11069 df-r 11134 df-lt 11137 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |