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

Theorem resspos 18389
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 7396 . 2 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ V)
2 eqid 2737 . . . . . . 7 (𝐹s 𝐴) = (𝐹s 𝐴)
3 eqid 2737 . . . . . . 7 (Base‘𝐹) = (Base‘𝐹)
42, 3ressbas 17200 . . . . . 6 (𝐴𝑉 → (𝐴 ∩ (Base‘𝐹)) = (Base‘(𝐹s 𝐴)))
5 inss2 4179 . . . . . 6 (𝐴 ∩ (Base‘𝐹)) ⊆ (Base‘𝐹)
64, 5eqsstrrdi 3968 . . . . 5 (𝐴𝑉 → (Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹))
76adantl 481 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹))
8 eqid 2737 . . . . . . 7 (le‘𝐹) = (le‘𝐹)
93, 8ispos 18274 . . . . . 6 (𝐹 ∈ Poset ↔ (𝐹 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
109simprbi 497 . . . . 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 3991 . . . . . . . 8 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
1312ralimdv 3152 . . . . . . 7 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
14 ssralv 3991 . . . . . . 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 3152 . . . . 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 3991 . . . . 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 17337 . . . . 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 633 . . . . . . . 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 633 . . . . . . . 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 1439 . . . . . 6 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) ↔ (𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
3231ralbidv 3161 . . . . 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 3202 . . . 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 2737 . . 3 (Base‘(𝐹s 𝐴)) = (Base‘(𝐹s 𝐴))
37 eqid 2737 . . 3 (le‘(𝐹s 𝐴)) = (le‘(𝐹s 𝐴))
3836, 37ispos 18274 . 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 584 1 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ Poset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  Vcvv 3430  cin 3889  wss 3890   class class class wbr 5086  cfv 6493  (class class class)co 7361  Basecbs 17173  s cress 17194  lecple 17221  Posetcpo 18267
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-cnex 11088  ax-resscn 11089  ax-1cn 11090  ax-icn 11091  ax-addcl 11092  ax-addrcl 11093  ax-mulcl 11094  ax-mulrcl 11095  ax-mulcom 11096  ax-addass 11097  ax-mulass 11098  ax-distr 11099  ax-i2m1 11100  ax-1ne0 11101  ax-1rid 11102  ax-rnegex 11103  ax-rrecex 11104  ax-cnre 11105  ax-pre-lttri 11106  ax-pre-lttrn 11107  ax-pre-ltadd 11108  ax-pre-mulgt0 11109
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7318  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-2nd 7937  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-pnf 11175  df-mnf 11176  df-xr 11177  df-ltxr 11178  df-le 11179  df-sub 11373  df-neg 11374  df-nn 12169  df-2 12238  df-3 12239  df-4 12240  df-5 12241  df-6 12242  df-7 12243  df-8 12244  df-9 12245  df-dec 12639  df-sets 17128  df-slot 17146  df-ndx 17158  df-base 17174  df-ress 17195  df-ple 17234  df-poset 18273
This theorem is referenced by:  resstos  18390
  Copyright terms: Public domain W3C validator