![]() |
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 11285. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttri 11184. (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 11126 | . 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴) | |
2 | elreal 11126 | . 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵) | |
3 | breq1 5152 | . . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑦, 0R⟩)) | |
4 | eqeq1 2737 | . . . . 5 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ 𝐴 = ⟨𝑦, 0R⟩)) | |
5 | breq2 5153 | . . . . 5 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩ ↔ ⟨𝑦, 0R⟩ <ℝ 𝐴)) | |
6 | 4, 5 | orbi12d 918 | . . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ (𝐴 = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴))) |
7 | 6 | notbid 318 | . . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (¬ (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ ¬ (𝐴 = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴))) |
8 | 3, 7 | bibi12d 346 | . 2 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ ¬ (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩)) ↔ (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ ¬ (𝐴 = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴)))) |
9 | breq2 5153 | . . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ 𝐵)) | |
10 | eqeq2 2745 | . . . . 5 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 = ⟨𝑦, 0R⟩ ↔ 𝐴 = 𝐵)) | |
11 | breq1 5152 | . . . . 5 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ <ℝ 𝐴 ↔ 𝐵 <ℝ 𝐴)) | |
12 | 10, 11 | orbi12d 918 | . . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴) ↔ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
13 | 12 | notbid 318 | . . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (¬ (𝐴 = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴) ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
14 | 9, 13 | bibi12d 346 | . 2 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ ¬ (𝐴 = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴)) ↔ (𝐴 <ℝ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴)))) |
15 | ltsosr 11089 | . . . 4 ⊢ <R Or R | |
16 | sotric 5617 | . . . 4 ⊢ (( <R Or R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → (𝑥 <R 𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥))) | |
17 | 15, 16 | mpan 689 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑥 <R 𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥))) |
18 | ltresr 11135 | . . 3 ⊢ (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦) | |
19 | vex 3479 | . . . . . 6 ⊢ 𝑥 ∈ V | |
20 | 19 | eqresr 11132 | . . . . 5 ⊢ (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ↔ 𝑥 = 𝑦) |
21 | ltresr 11135 | . . . . 5 ⊢ (⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩ ↔ 𝑦 <R 𝑥) | |
22 | 20, 21 | orbi12i 914 | . . . 4 ⊢ ((⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥)) |
23 | 22 | notbii 320 | . . 3 ⊢ (¬ (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦 <R 𝑥)) |
24 | 17, 18, 23 | 3bitr4g 314 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ ¬ (⟨𝑥, 0R⟩ = ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩))) |
25 | 1, 2, 8, 14, 24 | 2gencl 3517 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 <ℝ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 <ℝ 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ⟨cop 4635 class class class wbr 5149 Or wor 5588 Rcnr 10860 0Rc0r 10861 <R cltr 10866 ℝcr 11109 <ℝ cltrr 11114 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-oadd 8470 df-omul 8471 df-er 8703 df-ec 8705 df-qs 8709 df-ni 10867 df-pli 10868 df-mi 10869 df-lti 10870 df-plpq 10903 df-mpq 10904 df-ltpq 10905 df-enq 10906 df-nq 10907 df-erq 10908 df-plq 10909 df-mq 10910 df-1nq 10911 df-rq 10912 df-ltnq 10913 df-np 10976 df-1p 10977 df-plp 10978 df-ltp 10980 df-enr 11050 df-nr 11051 df-ltr 11054 df-0r 11055 df-r 11120 df-lt 11123 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |