| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sossfld | Structured version Visualization version GIF version | ||
| Description: The base set of a strict order is contained in the field of the relation, except possibly for one element (note that ∅ Or {𝐵}). (Contributed by Mario Carneiro, 27-Apr-2015.) |
| Ref | Expression |
|---|---|
| sossfld | ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐴 ∖ {𝐵}) ⊆ (dom 𝑅 ∪ ran 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsn 4737 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∖ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ≠ 𝐵)) | |
| 2 | sotrieq 5558 | . . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴)) → (𝑥 = 𝐵 ↔ ¬ (𝑥𝑅𝐵 ∨ 𝐵𝑅𝑥))) | |
| 3 | 2 | necon2abid 2971 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴)) → ((𝑥𝑅𝐵 ∨ 𝐵𝑅𝑥) ↔ 𝑥 ≠ 𝐵)) |
| 4 | 3 | anass1rs 655 | . . . . 5 ⊢ (((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → ((𝑥𝑅𝐵 ∨ 𝐵𝑅𝑥) ↔ 𝑥 ≠ 𝐵)) |
| 5 | breldmg 5853 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝑥𝑅𝐵) → 𝑥 ∈ dom 𝑅) | |
| 6 | 5 | 3expia 1121 | . . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑥𝑅𝐵 → 𝑥 ∈ dom 𝑅)) |
| 7 | 6 | ancoms 458 | . . . . . . . 8 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥𝑅𝐵 → 𝑥 ∈ dom 𝑅)) |
| 8 | brelrng 5885 | . . . . . . . . 9 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴 ∧ 𝐵𝑅𝑥) → 𝑥 ∈ ran 𝑅) | |
| 9 | 8 | 3expia 1121 | . . . . . . . 8 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐵𝑅𝑥 → 𝑥 ∈ ran 𝑅)) |
| 10 | 7, 9 | orim12d 966 | . . . . . . 7 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑥𝑅𝐵 ∨ 𝐵𝑅𝑥) → (𝑥 ∈ dom 𝑅 ∨ 𝑥 ∈ ran 𝑅))) |
| 11 | elun 4102 | . . . . . . 7 ⊢ (𝑥 ∈ (dom 𝑅 ∪ ran 𝑅) ↔ (𝑥 ∈ dom 𝑅 ∨ 𝑥 ∈ ran 𝑅)) | |
| 12 | 10, 11 | imbitrrdi 252 | . . . . . 6 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑥𝑅𝐵 ∨ 𝐵𝑅𝑥) → 𝑥 ∈ (dom 𝑅 ∪ ran 𝑅))) |
| 13 | 12 | adantll 714 | . . . . 5 ⊢ (((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → ((𝑥𝑅𝐵 ∨ 𝐵𝑅𝑥) → 𝑥 ∈ (dom 𝑅 ∪ ran 𝑅))) |
| 14 | 4, 13 | sylbird 260 | . . . 4 ⊢ (((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≠ 𝐵 → 𝑥 ∈ (dom 𝑅 ∪ ran 𝑅))) |
| 15 | 14 | expimpd 453 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ≠ 𝐵) → 𝑥 ∈ (dom 𝑅 ∪ ran 𝑅))) |
| 16 | 1, 15 | biimtrid 242 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑥 ∈ (𝐴 ∖ {𝐵}) → 𝑥 ∈ (dom 𝑅 ∪ ran 𝑅))) |
| 17 | 16 | ssrdv 3936 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐴 ∖ {𝐵}) ⊆ (dom 𝑅 ∪ ran 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∈ wcel 2113 ≠ wne 2929 ∖ cdif 3895 ∪ cun 3896 ⊆ wss 3898 {csn 4575 class class class wbr 5093 Or wor 5526 dom cdm 5619 ran crn 5620 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ne 2930 df-ral 3049 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-ss 3915 df-nul 4283 df-if 4475 df-sn 4576 df-pr 4578 df-op 4582 df-br 5094 df-opab 5156 df-po 5527 df-so 5528 df-cnv 5627 df-dm 5629 df-rn 5630 |
| This theorem is referenced by: sofld 6139 soex 7857 |
| Copyright terms: Public domain | W3C validator |