MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resspos Structured version   Visualization version   GIF version

Theorem resspos 18330
Description: The restriction of a Poset is a Poset. (Contributed by Thierry Arnoux, 20-Jan-2018.)
Assertion
Ref Expression
resspos ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ Poset)

Proof of Theorem resspos
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovexd 7376 . 2 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ V)
2 eqid 2731 . . . . . . 7 (𝐹s 𝐴) = (𝐹s 𝐴)
3 eqid 2731 . . . . . . 7 (Base‘𝐹) = (Base‘𝐹)
42, 3ressbas 17142 . . . . . 6 (𝐴𝑉 → (𝐴 ∩ (Base‘𝐹)) = (Base‘(𝐹s 𝐴)))
5 inss2 4183 . . . . . 6 (𝐴 ∩ (Base‘𝐹)) ⊆ (Base‘𝐹)
64, 5eqsstrrdi 3975 . . . . 5 (𝐴𝑉 → (Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹))
76adantl 481 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹))
8 eqid 2731 . . . . . . 7 (le‘𝐹) = (le‘𝐹)
93, 8ispos 18215 . . . . . 6 (𝐹 ∈ Poset ↔ (𝐹 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
109simprbi 496 . . . . 5 (𝐹 ∈ Poset → ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)))
1110adantr 480 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)))
12 ssralv 3998 . . . . . . . 8 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
1312ralimdv 3146 . . . . . . 7 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
14 ssralv 3998 . . . . . . 7 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
1513, 14syld 47 . . . . . 6 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
1615ralimdv 3146 . . . . 5 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
17 ssralv 3998 . . . . 5 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
1816, 17syld 47 . . . 4 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
197, 11, 18sylc 65 . . 3 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)))
202, 8ressle 17279 . . . . 5 (𝐴𝑉 → (le‘𝐹) = (le‘(𝐹s 𝐴)))
2120adantl 481 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (le‘𝐹) = (le‘(𝐹s 𝐴)))
22 breq 5088 . . . . . . 7 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑥(le‘𝐹)𝑥𝑥(le‘(𝐹s 𝐴))𝑥))
23 breq 5088 . . . . . . . . 9 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑥(le‘𝐹)𝑦𝑥(le‘(𝐹s 𝐴))𝑦))
24 breq 5088 . . . . . . . . 9 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑦(le‘𝐹)𝑥𝑦(le‘(𝐹s 𝐴))𝑥))
2523, 24anbi12d 632 . . . . . . . 8 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) ↔ (𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥)))
2625imbi1d 341 . . . . . . 7 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ↔ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦)))
27 breq 5088 . . . . . . . . 9 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑦(le‘𝐹)𝑧𝑦(le‘(𝐹s 𝐴))𝑧))
2823, 27anbi12d 632 . . . . . . . 8 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) ↔ (𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧)))
29 breq 5088 . . . . . . . 8 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑥(le‘𝐹)𝑧𝑥(le‘(𝐹s 𝐴))𝑧))
3028, 29imbi12d 344 . . . . . . 7 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧) ↔ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧)))
3122, 26, 303anbi123d 1438 . . . . . 6 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) ↔ (𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
3231ralbidv 3155 . . . . 5 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) ↔ ∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
33322ralbidv 3196 . . . 4 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) ↔ ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
3421, 33syl 17 . . 3 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) ↔ ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
3519, 34mpbid 232 . 2 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧)))
36 eqid 2731 . . 3 (Base‘(𝐹s 𝐴)) = (Base‘(𝐹s 𝐴))
37 eqid 2731 . . 3 (le‘(𝐹s 𝐴)) = (le‘(𝐹s 𝐴))
3836, 37ispos 18215 . 2 ((𝐹s 𝐴) ∈ Poset ↔ ((𝐹s 𝐴) ∈ V ∧ ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
391, 35, 38sylanbrc 583 1 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ Poset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2111  wral 3047  Vcvv 3436  cin 3896  wss 3897   class class class wbr 5086  cfv 6476  (class class class)co 7341  Basecbs 17115  s cress 17136  lecple 17163  Posetcpo 18208
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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pow 5298  ax-pr 5365  ax-un 7663  ax-cnex 11057  ax-resscn 11058  ax-1cn 11059  ax-icn 11060  ax-addcl 11061  ax-addrcl 11062  ax-mulcl 11063  ax-mulrcl 11064  ax-mulcom 11065  ax-addass 11066  ax-mulass 11067  ax-distr 11068  ax-i2m1 11069  ax-1ne0 11070  ax-1rid 11071  ax-rnegex 11072  ax-rrecex 11073  ax-cnre 11074  ax-pre-lttri 11075  ax-pre-lttrn 11076  ax-pre-ltadd 11077  ax-pre-mulgt0 11078
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-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-iun 4938  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5506  df-eprel 5511  df-po 5519  df-so 5520  df-fr 5564  df-we 5566  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-pred 6243  df-ord 6304  df-on 6305  df-lim 6306  df-suc 6307  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-om 7792  df-2nd 7917  df-frecs 8206  df-wrecs 8237  df-recs 8286  df-rdg 8324  df-er 8617  df-en 8865  df-dom 8866  df-sdom 8867  df-pnf 11143  df-mnf 11144  df-xr 11145  df-ltxr 11146  df-le 11147  df-sub 11341  df-neg 11342  df-nn 12121  df-2 12183  df-3 12184  df-4 12185  df-5 12186  df-6 12187  df-7 12188  df-8 12189  df-9 12190  df-dec 12584  df-sets 17070  df-slot 17088  df-ndx 17100  df-base 17116  df-ress 17137  df-ple 17176  df-poset 18214
This theorem is referenced by:  resstos  18331
  Copyright terms: Public domain W3C validator