Will Jimmy fall off his platform? Backstory
Meet my friend Jimmy:
/o\

Jimmy is a little character who likes to stand on platforms. Here's Jimmy safely standing on a platform:
         /o\
  -------------

Now, Jimmy has a good sense of balance, so he can safely stand with one leg off of the platform, like so:
   /o\
    -------------------

Although if he stands with two or more body parts off of the platform, he will fall. Both of these are examples where Jimmy will fall:
/o\                                       /o\
  ----------        ----------------------   

The challenge
Your challenge is to write a program to determine, given a string with Jimmy's platform and position, if Jimmy can stand on the platform without falling off.

Input: Two lines showing Jimmy's position and the position of the platform under him. This can be from two separate inputs, a single input, or an array of some sort.


You may take input through any reasonable form, includings functions and standard input. Only resort to hard-coding if your language does not support the other input methods.


Output: The boolean values true and false, or the integers 1 or 0 to represent true/false respectively.


The boolean value is based off of whether Jimmy can stay on the platform or not - true if Jimmy can stay on the platform, or false if he will fall off.


The platform size is arbitrary and can be changed at will. Your program should account for that.


The platform cannot be a length of zero, and the platform must be complete (no holes in the platform).

Remember that Jimmy falls off when two of his body parts are hanging off the platform. A body part is one ASCII character of his body.

Trailing whitespace at the end of the platform is not required, but your program should account for both situations, where there is whitespace after the platform and where there is not.



Be mindful of the standard loopholes that are forbidden.

Test cases
         /o\               ✔️ TRUE
  -------------

/o\                        ✔️ TRUE
 ----------

                    /o\    ❌ FALSE
  ------------------

               /o\         ❌ FALSE
  -------

    /o\                    ❌ FALSE
     -

Scoring
This is code-golf, so lowest byte count wins.
Leaderboard
You can view the leaderboard for this post by expanding the widget/snippet below. In order for your post to be included in the rankings, you need a header (# header text) with the following info:

The name of the language (end it with a comma , or dash -), followed by...

The byte count, as the last number to appear in your header.


For example, JavaScript (ES6), 72 bytes is valid, but Fortran, 143 bytes (8-bit) is invalid because the byte count is not the last number in the header (your answer will be recognized as 8 bytes - don't take advantage of this).


&lt;!-- Run the snippet to see the leaderboard. Report any bugs to @ozewski on Github --&gt;    &lt;iframe src="https://ozewski.github.io/ppcg-leaderboard/?id=187586" width="100%" height="100%" style="border:none;"&gt;Oops, your browser is too old to view this content! Please upgrade to a newer version of your browser that supports HTML5.&lt;/iframe&gt;&lt;style&gt;html,body{margin:0;padding:0;height:100%;overflow:hidden}&lt;/style&gt;
Jelly, 6 bytes

n⁶Sċ2Ẓ


Try it online!

Explanation:

n⁶Sċ2Ẓ  args: z (e.g. [['/', 'o', '\\'], [' ', '-']] =&gt; 0)
        implicit return value: z ([['/', 'o', '\\'], [' ', '-']])
n⁶      dyad-nilad pair ([[1, 1, 1], [0, 1]])
 ⁶       4th command-line argument or space [4th CLA assumed absent] (' ')
n        vectorized inequality ([[1, 1, 1], [0, 1]])
  S     reduction by addition with base case 0 ([1, 2, 1])
   ċ2   dyad-nilad pair (1)
    2    literal (2)
   ċ     number of occurrences of right in left (1)
     Ẓ  primality (0)