| 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 11385. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttri 11278. (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 11220 | . 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 2 | elreal 11220 | . 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R 〈𝑦, 0R〉 = 𝐵) | |
| 3 | breq1 5105 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 𝐴 <ℝ 〈𝑦, 0R〉)) | |
| 4 | eqeq1 2764 | . . . . 5 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ 𝐴 = 〈𝑦, 0R〉)) | |
| 5 | breq2 5106 | . . . . 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 5106 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 <ℝ 〈𝑦, 0R〉 ↔ 𝐴 <ℝ 𝐵)) | |
| 10 | eqeq2 2772 | . . . . 5 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 = 〈𝑦, 0R〉 ↔ 𝐴 = 𝐵)) | |
| 11 | breq1 5105 | . . . . 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 11183 | . . . 4 ⊢ <R Or R | |
| 16 | sotric 5588 | . . . 4 ⊢ (( <R Or R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → (𝑥 <R 𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥))) | |
| 17 | 15, 16 | mpan 703 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑥 <R 𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥))) |
| 18 | ltresr 11229 | . . 3 ⊢ (〈𝑥, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 𝑥 <R 𝑦) | |
| 19 | vex 3454 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 20 | 19 | eqresr 11226 | . . . . 5 ⊢ (〈𝑥, 0R〉 = 〈𝑦, 0R〉 ↔ 𝑥 = 𝑦) |
| 21 | ltresr 11229 | . . . . 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 1569 ∈ wcel 2144 〈cop 4834 class class class wbr 5102 Or wor 5557 Rcnr 10954 0Rc0r 10955 <R cltr 10960 ℝcr 11203 <ℝ cltrr 11208 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-inf2 9646 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-oadd 8484 df-omul 8485 df-er 8721 df-ec 8723 df-qs 8727 df-ni 10961 df-pli 10962 df-mi 10963 df-lti 10964 df-plpq 10997 df-mpq 10998 df-ltpq 10999 df-enq 11000 df-nq 11001 df-erq 11002 df-plq 11003 df-mq 11004 df-1nq 11005 df-rq 11006 df-ltnq 11007 df-np 11070 df-1p 11071 df-plp 11072 df-ltp 11074 df-enr 11144 df-nr 11145 df-ltr 11148 df-0r 11149 df-r 11214 df-lt 11217 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |