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

Theorem resspos 18461
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 7431 . 2 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ V)
2 eqid 2762 . . . . . . 7 (𝐹s 𝐴) = (𝐹s 𝐴)
3 eqid 2762 . . . . . . 7 (Base‘𝐹) = (Base‘𝐹)
42, 3ressbas 17272 . . . . . 6 (𝐴𝑉 → (𝐴 ∩ (Base‘𝐹)) = (Base‘(𝐹s 𝐴)))
5 inss2 4189 . . . . . 6 (𝐴 ∩ (Base‘𝐹)) ⊆ (Base‘𝐹)
64, 5eqsstrrdi 3981 . . . . 5 (𝐴𝑉 → (Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹))
76adantl 485 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹))
8 eqid 2762 . . . . . . 7 (le‘𝐹) = (le‘𝐹)
93, 8ispos 18346 . . . . . 6 (𝐹 ∈ Poset ↔ (𝐹 ∈ V ∧ ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
109simprbi 501 . . . . 5 (𝐹 ∈ Poset → ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)))
1110adantr 484 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → ∀𝑥 ∈ (Base‘𝐹)∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)))
12 ssralv 4005 . . . . . . . 8 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
1312ralimdv 3176 . . . . . . 7 ((Base‘(𝐹s 𝐴)) ⊆ (Base‘𝐹) → (∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘𝐹)(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) → ∀𝑦 ∈ (Base‘𝐹)∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧))))
14 ssralv 4005 . . . . . . 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 3176 . . . . 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 4005 . . . . 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 17409 . . . . 5 (𝐴𝑉 → (le‘𝐹) = (le‘(𝐹s 𝐴)))
2120adantl 485 . . . 4 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (le‘𝐹) = (le‘(𝐹s 𝐴)))
22 breq 5102 . . . . . . 7 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑥(le‘𝐹)𝑥𝑥(le‘(𝐹s 𝐴))𝑥))
23 breq 5102 . . . . . . . . 9 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑥(le‘𝐹)𝑦𝑥(le‘(𝐹s 𝐴))𝑦))
24 breq 5102 . . . . . . . . 9 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑦(le‘𝐹)𝑥𝑦(le‘(𝐹s 𝐴))𝑥))
2523, 24anbi12d 641 . . . . . . . 8 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) ↔ (𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥)))
2625imbi1d 343 . . . . . . 7 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ↔ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦)))
27 breq 5102 . . . . . . . . 9 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑦(le‘𝐹)𝑧𝑦(le‘(𝐹s 𝐴))𝑧))
2823, 27anbi12d 641 . . . . . . . 8 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) ↔ (𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧)))
29 breq 5102 . . . . . . . 8 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (𝑥(le‘𝐹)𝑧𝑥(le‘(𝐹s 𝐴))𝑧))
3028, 29imbi12d 346 . . . . . . 7 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → (((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧) ↔ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧)))
3122, 26, 303anbi123d 1457 . . . . . 6 ((le‘𝐹) = (le‘(𝐹s 𝐴)) → ((𝑥(le‘𝐹)𝑥 ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘𝐹)𝑦𝑦(le‘𝐹)𝑧) → 𝑥(le‘𝐹)𝑧)) ↔ (𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧))))
3231ralbidv 3185 . . . . 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 3226 . . . 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 234 . 2 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → ∀𝑥 ∈ (Base‘(𝐹s 𝐴))∀𝑦 ∈ (Base‘(𝐹s 𝐴))∀𝑧 ∈ (Base‘(𝐹s 𝐴))(𝑥(le‘(𝐹s 𝐴))𝑥 ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑥) → 𝑥 = 𝑦) ∧ ((𝑥(le‘(𝐹s 𝐴))𝑦𝑦(le‘(𝐹s 𝐴))𝑧) → 𝑥(le‘(𝐹s 𝐴))𝑧)))
36 eqid 2762 . . 3 (Base‘(𝐹s 𝐴)) = (Base‘(𝐹s 𝐴))
37 eqid 2762 . . 3 (le‘(𝐹s 𝐴)) = (le‘(𝐹s 𝐴))
3836, 37ispos 18346 . 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 592 1 ((𝐹 ∈ Poset ∧ 𝐴𝑉) → (𝐹s 𝐴) ∈ Poset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1098   = wceq 1560  wcel 2142  wral 3076  Vcvv 3454  cin 3903  wss 3904   class class class wbr 5100  cfv 6521  (class class class)co 7396  Basecbs 17245  s cress 17266  lecple 17293  Posetcpo 18339
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-resscn 11130  ax-1cn 11131  ax-icn 11132  ax-addcl 11133  ax-addrcl 11134  ax-mulcl 11135  ax-mulrcl 11136  ax-mulcom 11137  ax-addass 11138  ax-mulass 11139  ax-distr 11140  ax-i2m1 11141  ax-1ne0 11142  ax-1rid 11143  ax-rnegex 11144  ax-rrecex 11145  ax-cnre 11146  ax-pre-lttri 11147  ax-pre-lttrn 11148  ax-pre-ltadd 11149  ax-pre-mulgt0 11150
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-er 8678  df-en 8928  df-dom 8929  df-sdom 8930  df-pnf 11218  df-mnf 11219  df-xr 11220  df-ltxr 11221  df-le 11222  df-sub 11416  df-neg 11417  df-nn 12211  df-2 12280  df-3 12281  df-4 12282  df-5 12283  df-6 12284  df-7 12285  df-8 12286  df-9 12287  df-n0 12482  df-z 12569  df-dec 12689  df-sets 17200  df-slot 17218  df-ndx 17230  df-base 17246  df-ress 17267  df-ple 17306  df-poset 18345
This theorem is referenced by:  resstos  18462
  Copyright terms: Public domain W3C validator