Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  funpsstri Structured version   Visualization version   GIF version

Theorem funpsstri 36624
Description: A condition for subset trichotomy for functions. (Contributed by Scott Fenton, 19-Apr-2011.)
Assertion
Ref Expression
funpsstri ((Fun 𝐻 ∧ (𝐹 ⊆ 𝐻 ∧ 𝐺 ⊆ 𝐻) ∧ (dom 𝐹 ⊆ dom 𝐺 ∨ dom 𝐺 ⊆ dom 𝐹)) → (𝐹 ⊊ 𝐺 ∨ 𝐹 = 𝐺 ∨ 𝐺 ⊊ 𝐹))

Proof of Theorem funpsstri
StepHypRef Expression
1 funssres 6585 . . . . . 6 ((Fun 𝐻 ∧ 𝐹 ⊆ 𝐻) → (𝐻 ↾ dom 𝐹) = 𝐹)
21ex 418 . . . . 5 (Fun 𝐻 → (𝐹 ⊆ 𝐻 → (𝐻 ↾ dom 𝐹) = 𝐹))
3 funssres 6585 . . . . . 6 ((Fun 𝐻 ∧ 𝐺 ⊆ 𝐻) → (𝐻 ↾ dom 𝐺) = 𝐺)
43ex 418 . . . . 5 (Fun 𝐻 → (𝐺 ⊆ 𝐻 → (𝐻 ↾ dom 𝐺) = 𝐺))
52, 4anim12d 621 . . . 4 (Fun 𝐻 → ((𝐹 ⊆ 𝐻 ∧ 𝐺 ⊆ 𝐻) → ((𝐻 ↾ dom 𝐹) = 𝐹 ∧ (𝐻 ↾ dom 𝐺) = 𝐺)))
6 ssres2 5994 . . . . . 6 (dom 𝐹 ⊆ dom 𝐺 → (𝐻 ↾ dom 𝐹) ⊆ (𝐻 ↾ dom 𝐺))
7 ssres2 5994 . . . . . 6 (dom 𝐺 ⊆ dom 𝐹 → (𝐻 ↾ dom 𝐺) ⊆ (𝐻 ↾ dom 𝐹))
86, 7orim12i 922 . . . . 5 ((dom 𝐹 ⊆ dom 𝐺 ∨ dom 𝐺 ⊆ dom 𝐹) → ((𝐻 ↾ dom 𝐹) ⊆ (𝐻 ↾ dom 𝐺) ∨ (𝐻 ↾ dom 𝐺) ⊆ (𝐻 ↾ dom 𝐹)))
9 sseq12 3935 . . . . . 6 (((𝐻 ↾ dom 𝐹) = 𝐹 ∧ (𝐻 ↾ dom 𝐺) = 𝐺) → ((𝐻 ↾ dom 𝐹) ⊆ (𝐻 ↾ dom 𝐺) ↔ 𝐹 ⊆ 𝐺))
10 sseq12 3935 . . . . . . 7 (((𝐻 ↾ dom 𝐺) = 𝐺 ∧ (𝐻 ↾ dom 𝐹) = 𝐹) → ((𝐻 ↾ dom 𝐺) ⊆ (𝐻 ↾ dom 𝐹) ↔ 𝐺 ⊆ 𝐹))
1110ancoms 464 . . . . . 6 (((𝐻 ↾ dom 𝐹) = 𝐹 ∧ (𝐻 ↾ dom 𝐺) = 𝐺) → ((𝐻 ↾ dom 𝐺) ⊆ (𝐻 ↾ dom 𝐹) ↔ 𝐺 ⊆ 𝐹))
129, 11orbi12d 932 . . . . 5 (((𝐻 ↾ dom 𝐹) = 𝐹 ∧ (𝐻 ↾ dom 𝐺) = 𝐺) → (((𝐻 ↾ dom 𝐹) ⊆ (𝐻 ↾ dom 𝐺) ∨ (𝐻 ↾ dom 𝐺) ⊆ (𝐻 ↾ dom 𝐹)) ↔ (𝐹 ⊆ 𝐺 ∨ 𝐺 ⊆ 𝐹)))
138, 12imbitrid 247 . . . 4 (((𝐻 ↾ dom 𝐹) = 𝐹 ∧ (𝐻 ↾ dom 𝐺) = 𝐺) → ((dom 𝐹 ⊆ dom 𝐺 ∨ dom 𝐺 ⊆ dom 𝐹) → (𝐹 ⊆ 𝐺 ∨ 𝐺 ⊆ 𝐹)))
145, 13syl6 36 . . 3 (Fun 𝐻 → ((𝐹 ⊆ 𝐻 ∧ 𝐺 ⊆ 𝐻) → ((dom 𝐹 ⊆ dom 𝐺 ∨ dom 𝐺 ⊆ dom 𝐹) → (𝐹 ⊆ 𝐺 ∨ 𝐺 ⊆ 𝐹))))
15143imp 1128 . 2 ((Fun 𝐻 ∧ (𝐹 ⊆ 𝐻 ∧ 𝐺 ⊆ 𝐻) ∧ (dom 𝐹 ⊆ dom 𝐺 ∨ dom 𝐺 ⊆ dom 𝐹)) → (𝐹 ⊆ 𝐺 ∨ 𝐺 ⊆ 𝐹))
16 sspsstri 4033 . 2 ((𝐹 ⊆ 𝐺 ∨ 𝐺 ⊆ 𝐹) ↔ (𝐹 ⊊ 𝐺 ∨ 𝐹 = 𝐺 ∨ 𝐺 ⊊ 𝐹))
1715, 16sylib 221 1 ((Fun 𝐻 ∧ (𝐹 ⊆ 𝐻 ∧ 𝐺 ⊆ 𝐻) ∧ (dom 𝐹 ⊆ dom 𝐺 ∨ dom 𝐺 ⊆ dom 𝐹)) → (𝐹 ⊊ 𝐺 ∨ 𝐹 = 𝐺 ∨ 𝐺 ⊊ 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   ∧ w3a 1103   = wceq 1569   ⊆ wss 3895   ⊊ wpss 4013  dom cdm 5650   ↾ cres 5652  Fun wfun 6533
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-res 5662  df-fun 6541
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator