Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > swopolem | Structured version Visualization version GIF version |
Description: Perform the substitutions into the strict weak ordering law. (Contributed by Mario Carneiro, 31-Dec-2014.) |
Ref | Expression |
---|---|
swopolem.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) |
Ref | Expression |
---|---|
swopolem | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) → (𝑋𝑅𝑌 → (𝑋𝑅𝑍 ∨ 𝑍𝑅𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | swopolem.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) | |
2 | 1 | ralrimivvva 3115 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) |
3 | breq1 5073 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝑅𝑦 ↔ 𝑋𝑅𝑦)) | |
4 | breq1 5073 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥𝑅𝑧 ↔ 𝑋𝑅𝑧)) | |
5 | 4 | orbi1d 913 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦) ↔ (𝑋𝑅𝑧 ∨ 𝑧𝑅𝑦))) |
6 | 3, 5 | imbi12d 344 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝑋𝑅𝑦 → (𝑋𝑅𝑧 ∨ 𝑧𝑅𝑦)))) |
7 | breq2 5074 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌)) | |
8 | breq2 5074 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝑌)) | |
9 | 8 | orbi2d 912 | . . . 4 ⊢ (𝑦 = 𝑌 → ((𝑋𝑅𝑧 ∨ 𝑧𝑅𝑦) ↔ (𝑋𝑅𝑧 ∨ 𝑧𝑅𝑌))) |
10 | 7, 9 | imbi12d 344 | . . 3 ⊢ (𝑦 = 𝑌 → ((𝑋𝑅𝑦 → (𝑋𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝑋𝑅𝑌 → (𝑋𝑅𝑧 ∨ 𝑧𝑅𝑌)))) |
11 | breq2 5074 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑋𝑅𝑧 ↔ 𝑋𝑅𝑍)) | |
12 | breq1 5073 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑧𝑅𝑌 ↔ 𝑍𝑅𝑌)) | |
13 | 11, 12 | orbi12d 915 | . . . 4 ⊢ (𝑧 = 𝑍 → ((𝑋𝑅𝑧 ∨ 𝑧𝑅𝑌) ↔ (𝑋𝑅𝑍 ∨ 𝑍𝑅𝑌))) |
14 | 13 | imbi2d 340 | . . 3 ⊢ (𝑧 = 𝑍 → ((𝑋𝑅𝑌 → (𝑋𝑅𝑧 ∨ 𝑧𝑅𝑌)) ↔ (𝑋𝑅𝑌 → (𝑋𝑅𝑍 ∨ 𝑍𝑅𝑌)))) |
15 | 6, 10, 14 | rspc3v 3565 | . 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) → (𝑋𝑅𝑌 → (𝑋𝑅𝑍 ∨ 𝑍𝑅𝑌)))) |
16 | 2, 15 | mpan9 506 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴 ∧ 𝑍 ∈ 𝐴)) → (𝑋𝑅𝑌 → (𝑋𝑅𝑍 ∨ 𝑍𝑅𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∀wral 3063 class class class wbr 5070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 |
This theorem is referenced by: swoer 8486 swoord1 8487 swoord2 8488 |
Copyright terms: Public domain | W3C validator |